MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  sbcopeq1a Structured version   Visualization version   GIF version

Theorem sbcopeq1a 8034
Description: Equality theorem for substitution of a class for an ordered pair (analogue of sbceq1a 3758 that avoids the existential quantifiers of copsexg 5465). (Contributed by NM, 19-Aug-2006.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
sbcopeq1a (𝐴 = ⟨𝑥, 𝑦⟩ → ([(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑𝜑))

Proof of Theorem sbcopeq1a
StepHypRef Expression
1 vex 3461 . . . . 5 𝑥 ∈ V
2 vex 3461 . . . . 5 𝑦 ∈ V
31, 2op2ndd 7985 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → (2nd𝐴) = 𝑦)
43eqcomd 2771 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑦 = (2nd𝐴))
5 sbceq1a 3758 . . 3 (𝑦 = (2nd𝐴) → (𝜑[(2nd𝐴) / 𝑦]𝜑))
64, 5syl 18 . 2 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝜑[(2nd𝐴) / 𝑦]𝜑))
71, 2op1std 7984 . . . 4 (𝐴 = ⟨𝑥, 𝑦⟩ → (1st𝐴) = 𝑥)
87eqcomd 2771 . . 3 (𝐴 = ⟨𝑥, 𝑦⟩ → 𝑥 = (1st𝐴))
9 sbceq1a 3758 . . 3 (𝑥 = (1st𝐴) → ([(2nd𝐴) / 𝑦]𝜑[(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑))
108, 9syl 18 . 2 (𝐴 = ⟨𝑥, 𝑦⟩ → ([(2nd𝐴) / 𝑦]𝜑[(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑))
116, 10bitr2d 283 1 (𝐴 = ⟨𝑥, 𝑦⟩ → ([(1st𝐴) / 𝑥][(2nd𝐴) / 𝑦]𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1563  [wsbc 3747  cop 4591  cfv 6525  1st c1st 7972  2nd c2nd 7973
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-iota 6481  df-fun 6527  df-fv 6533  df-1st 7974  df-2nd 7975
This theorem is referenced by:  dfopab2  8037  dfoprab3s  8038  ralxpes  8120  frpoins3xpg  8124
  Copyright terms: Public domain W3C validator