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

Theorem 3sstr3d 2114
Description: Substitution of equality into both sides of a subclass relationship.
Hypotheses
Ref Expression
3sstr3d.1 |- (ph -> A (_ B)
3sstr3d.2 |- (ph -> A = C)
3sstr3d.3 |- (ph -> B = D)
Assertion
Ref Expression
3sstr3d |- (ph -> C (_ D)

Proof of Theorem 3sstr3d
StepHypRef Expression
1 3sstr3d.1 . 2 |- (ph -> A (_ B)
2 3sstr3d.2 . . 3 |- (ph -> A = C)
3 3sstr3d.3 . . 3 |- (ph -> B = D)
42, 3sseq12d 2101 . 2 |- (ph -> (A (_ B <-> C (_ D))
51, 4mpbid 195 1 |- (ph -> C (_ D)
Colors of variables: wff set class
Syntax hints:   -> wi 3   = wceq 960   (_ wss 2058
This theorem is referenced by:  shlej2 9380  pjspansn 9524
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 966  ax-gen 967  ax-8 968  ax-10 970  ax-12 972  ax-17 975  ax-4 977  ax-5o 979  ax-6o 982  ax-9o 1127  ax-10o 1144  ax-16 1214  ax-11o 1222  ax-ext 1464
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 985  df-sb 1176  df-clab 1470  df-cleq 1475  df-clel 1478  df-in 2062  df-ss 2064
Copyright terms: Public domain