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

Theorem hba1w 1707
Description: Weak version of hba1 1786. See comments for ax6w 1717. Uses only Tarski's FOL axiom schemes. (Contributed by NM, 9-Apr-2017.)
Hypothesis
Ref Expression
hbn1w.1
Assertion
Ref Expression
hba1w
Distinct variable groups:   ,   ,   ,
Allowed substitution hints:   ()   ()

Proof of Theorem hba1w
StepHypRef Expression
1 hbn1w.1 . . . . . . 7
21cbvalvw 1702 . . . . . 6
32a1i 10 . . . . 5
43notbid 285 . . . 4
54spw 1694 . . 3
65con2i 112 . 2
74hbn1w 1706 . 2
81hbn1w 1706 . . . 4
98con1i 121 . . 3
109alimi 1559 . 2
116, 7, 103syl 18 1
Colors of variables: wff setvar class
Syntax hints:   wn 3   wi 4   wb 176  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
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