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

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

Proof of Theorem ax11indn
StepHypRef Expression
1 19.8a 1756 . . 3
2 exanali 1585 . . . 4
3 hbn1 1730 . . . . 5
4 hbn1 1730 . . . . 5
5 ax11indn.1 . . . . . . 7
6 con3 126 . . . . . . 7
75, 6syl6 29 . . . . . 6
87com23 72 . . . . 5
93, 4, 8alrimdh 1587 . . . 4
102, 9syl5bi 208 . . 3
111, 10syl5 28 . 2
1211exp3a 425 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wa 358  wal 1540  wex 1541 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 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:  ax11indi  2196
 Copyright terms: Public domain W3C validator