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

Theorem sbcoteq1a 8036
Description: Equality theorem for substitution of a class for an ordered triple. (Contributed by Scott Fenton, 22-Aug-2024.)
Assertion
Ref Expression
sbcoteq1a (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑𝜑))

Proof of Theorem sbcoteq1a
StepHypRef Expression
1 fveq2 6871 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd𝐴) = (2nd ‘⟨𝑥, 𝑦, 𝑧⟩))
2 ot3rdg 7990 . . . . 5 (𝑧 ∈ V → (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧)
32elv 3462 . . . 4 (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧
41, 3eqtr2di 2817 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑧 = (2nd𝐴))
5 sbceq1a 3758 . . 3 (𝑧 = (2nd𝐴) → (𝜑[(2nd𝐴) / 𝑧]𝜑))
64, 5syl 18 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝜑[(2nd𝐴) / 𝑧]𝜑))
7 2fveq3 6876 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘(1st𝐴)) = (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
8 vex 3461 . . . . 5 𝑥 ∈ V
9 vex 3461 . . . . 5 𝑦 ∈ V
10 vex 3461 . . . . 5 𝑧 ∈ V
11 ot2ndg 7989 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦)
128, 9, 10, 11mp3an 1485 . . . 4 (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦
137, 12eqtr2di 2817 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑦 = (2nd ‘(1st𝐴)))
14 sbceq1a 3758 . . 3 (𝑦 = (2nd ‘(1st𝐴)) → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
1513, 14syl 18 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
16 2fveq3 6876 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (1st ‘(1st𝐴)) = (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
17 ot1stg 7988 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥)
188, 9, 10, 17mp3an 1485 . . . 4 (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥
1916, 18eqtr2di 2817 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑥 = (1st ‘(1st𝐴)))
20 sbceq1a 3758 . . 3 (𝑥 = (1st ‘(1st𝐴)) → ([(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑[(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
2119, 20syl 18 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑[(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
226, 15, 213bitrrd 309 1 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209   = wceq 1563  wcel 2145  Vcvv 3457  [wsbc 3747  cotp 4593  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 5250  ax-nul 5260  ax-pr 5394  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-ot 4594  df-uni 4868  df-br 5105  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6481  df-fun 6527  df-fv 6533  df-1st 7974  df-2nd 7975
This theorem is referenced by:  ralxp3es  8123  frpoins3xp3g  8125
  Copyright terms: Public domain W3C validator