MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  hba1w Unicode version

Theorem hba1w 1814
Description: Weak version of hba1 1896. See comments for ax10w 1825. 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:   ,   ,   ,

Proof of Theorem hba1w
StepHypRef Expression
1 hbn1w.1 . . . . . . 7
21cbvalvw 1809 . . . . . 6
32a1i 11 . . . . 5
43notbid 294 . . . 4
54spw 1807 . . 3
65con2i 120 . 2
74hbn1w 1813 . 2
81hbn1w 1813 . . . 4
98con1i 129 . . 3
109alimi 1633 . 2
116, 7, 103syl 20 1
Colors of variables: wff setvar class
Syntax hints:  -.wn 3  ->wi 4  <->wb 184  A.wal 1393
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790
This theorem depends on definitions:  df-bi 185  df-ex 1613
  Copyright terms: Public domain W3C validator