Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ax11i | Unicode version |
Description: Inference that has ax-11 1397 (without ) as its conclusion and doesn't require ax-10 1396, ax-11 1397, or ax-12 1402 for its proof. The hypotheses may be eliminable without one or more of these axioms in special cases. Proof similar to Lemma 16 of [Tarski] p. 70. (Contributed by NM, 20-May-2008.) |
Ref | Expression |
---|---|
ax11i.1 | |
ax11i.2 |
Ref | Expression |
---|---|
ax11i |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax11i.1 | . 2 | |
2 | ax11i.2 | . . 3 | |
3 | 1 | biimprcd 149 | . . 3 |
4 | 2, 3 | alrimih 1358 | . 2 |
5 | 1, 4 | syl6bi 152 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wb 98 wal 1241 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-gen 1338 |
This theorem depends on definitions: df-bi 110 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |