HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem hbbid 1112
Description: Deduction form of bound-variable hypothesis builder hbbi 1010.
Hypotheses
Ref Expression
hbbid.1 |- (ph -> A.xph)
hbbid.2 |- (ph -> (ps -> A.xps))
hbbid.3 |- (ph -> (ch -> A.xch))
Assertion
Ref Expression
hbbid |- (ph -> ((ps <-> ch) -> A.x(ps <-> ch)))

Proof of Theorem hbbid
StepHypRef Expression
1 hbbid.1 . . . 4 |- (ph -> A.xph)
2 hbbid.2 . . . 4 |- (ph -> (ps -> A.xps))
3 hbbid.3 . . . 4 |- (ph -> (ch -> A.xch))
41, 2, 3hbimd 1110 . . 3 |- (ph -> ((ps -> ch) -> A.x(ps -> ch)))
51, 3, 2hbimd 1110 . . 3 |- (ph -> ((ch -> ps) -> A.x(ch -> ps)))
64, 5anim12d 558 . 2 |- (ph -> (((ps -> ch) /\ (ch -> ps)) -> (A.x(ps -> ch) /\ A.x(ch -> ps))))
7 dfbi2 514 . 2 |- ((ps <-> ch) <-> ((ps -> ch) /\ (ch -> ps)))
8 albi 1107 . 2 |- (A.x(ps <-> ch) <-> (A.x(ps -> ch) /\ A.x(ch -> ps)))
96, 7, 83imtr4g 553 1 |- (ph -> ((ps <-> ch) -> A.x(ps <-> ch)))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   /\ wa 223  A.wal 954
This theorem is referenced by:  hbeu 1389  reuuni2f 2883  axextnd 4943  axrepndlem1 4944  axrepndlem2 4945  axacndlem4 4962  axacndlem5 4963  axacnd 4964
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-4 973  ax-5o 975  ax-6o 978
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain