Linear Logic Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > LLPE Home > Th. List > eac2i | Structured version |
Description: & elimination rule, right hand side. Inference form of ax-eac2 34. |
Ref | Expression |
---|---|
eac2i.1 | ⊦ (𝜑 & 𝜓) |
Ref | Expression |
---|---|
eac2i | ⊦ 𝜓 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eac2i.1 | . . . 4 ⊦ (𝜑 & 𝜓) | |
2 | 1 | inenebot 27 | . . 3 ⊦ (~ ~ ⊥ ⅋ (𝜑 & 𝜓)) |
3 | 2 | ax-eac2 34 | . 2 ⊦ (~ ~ ⊥ ⅋ 𝜓) |
4 | 3 | enenebot 28 | 1 ⊦ 𝜓 |
Colors of variables: wff var nilad |
Syntax hints: ⊥wbot 1 ~ wneg 3 & wac 30 |
This theorem was proved from axioms: ax-ibot 4 ax-ebot 5 ax-cut 6 ax-init 7 ax-mdco 8 ax-eac2 34 |
This theorem is referenced by: lb2d 58 lbi1s 87 dflb2s 92 |
Copyright terms: Public domain | W3C validator |