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

Theorem psseq12d 1566
Description: An equality deduction for the proper subclass relationship.
Hypotheses
Ref Expression
psseq1d.1 |- (ph -> A = B)
psseq12d.2 |- (ph -> C = D)
Assertion
Ref Expression
psseq12d |- (ph -> (A (. C <-> B (. D))

Proof of Theorem psseq12d
StepHypRef Expression
1 psseq1d.1 . . 3 |- (ph -> A = B)
21psseq1d 1564 . 2 |- (ph -> (A (. C <-> B (. C))
3 psseq12d.2 . . 3 |- (ph -> C = D)
43psseq2d 1565 . 2 |- (ph -> (B (. C <-> B (. D))
52, 4bitrd 406 1 |- (ph -> (A (. C <-> B (. D))
Colors of variables: wff set class
Syntax hints:   -> wi 2   <-> wb 127   = wceq 1091   (. wpss 1488
This theorem is referenced by:  chnlet 5431
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-ne 1192  df-in 1491  df-ss 1492  df-pss 1494
metamath.org