NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  ax11indi Unicode version

Theorem ax11indi 2196
Description: Induction step for constructing a substitution instance of ax-11o 2141 without using ax-11o 2141. Implication case. (Contributed by NM, 21-Jan-2007.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
ax11indn.1
ax11indi.2
Assertion
Ref Expression
ax11indi

Proof of Theorem ax11indi
StepHypRef Expression
1 ax11indn.1 . . . . . 6
21ax11indn 2195 . . . . 5
32imp 418 . . . 4
4 pm2.21 100 . . . . . 6
54imim2i 13 . . . . 5
65alimi 1559 . . . 4
73, 6syl6 29 . . 3
8 ax11indi.2 . . . . 5
98imp 418 . . . 4
10 ax-1 6 . . . . . 6
1110imim2i 13 . . . . 5
1211alimi 1559 . . . 4
139, 12syl6 29 . . 3
147, 13jad 154 . 2
1514ex 423 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   wa 358  wal 1540
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-11 1746
This theorem depends on definitions:  df-bi 177  df-an 360  df-ex 1542
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator