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

Theorem hbal 700
Description: If x is not free in ph, it is not free in A.yph.
Hypothesis
Ref Expression
hb.1 |- (ph -> A.xph)
Assertion
Ref Expression
hbal |- (A.yph -> A.xA.yph)

Proof of Theorem hbal
StepHypRef Expression
1 hb.1 . . 3 |- (ph -> A.xph)
2119.20i 691 . 2 |- (A.yph -> A.yA.xph)
3 ax-7 676 . 2 |- (A.yA.xph -> A.xA.yph)
42, 3syl 12 1 |- (A.yph -> A.xA.yph)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672
This theorem is referenced by:  hbex 701  aaan 794  sb8 918  cbval2 974  euf 1011  mo 1020  2eu3 1069  bm1.1 1088  hbeq 1171  hbral 1236  ralcom2 1314  axrep 1473  axrep2 1474  zfrep2 1475  hbint 1975  onminex 2275  dmcosseq 2572  axrepndlem1 3738  axacndlem4 3756  axacnd 3758  zfcndrep 3760  zfcndinf 3764  nnwof 4609
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-mp 6  ax-4 673  ax-5 674  ax-7 676  ax-gen 677
metamath.org