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

Theorem 2albidv 1280
Description: Formula-building rule for 2 existential quantifiers (deduction rule).
Hypothesis
Ref Expression
2albidv.1 |- (ph -> (ps <-> ch))
Assertion
Ref Expression
2albidv |- (ph -> (A.xA.yps <-> A.xA.ych))
Distinct variable groups:   ph,x   ph,y

Proof of Theorem 2albidv
StepHypRef Expression
1 2albidv.1 . . 3 |- (ph -> (ps <-> ch))
21albidv 1278 . 2 |- (ph -> (A.yps <-> A.ych))
32albidv 1278 1 |- (ph -> (A.xA.yps <-> A.xA.ych))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146  A.wal 954
This theorem is referenced by:  2mo 1447  2eu6 1454  f1fv 3874  closedsub 9093  isfil 10558
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-gen 963  ax-17 971  ax-4 973  ax-5o 975
This theorem depends on definitions:  df-bi 147  df-an 225
Copyright terms: Public domain