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

Theorem sbcoteq1a 7997
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 6834 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd𝐴) = (2nd ‘⟨𝑥, 𝑦, 𝑧⟩))
2 ot3rdg 7951 . . . . 5 (𝑧 ∈ V → (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧)
32elv 3435 . . . 4 (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧
41, 3eqtr2di 2789 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑧 = (2nd𝐴))
5 sbceq1a 3740 . . 3 (𝑧 = (2nd𝐴) → (𝜑[(2nd𝐴) / 𝑧]𝜑))
64, 5syl 17 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝜑[(2nd𝐴) / 𝑧]𝜑))
7 2fveq3 6839 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘(1st𝐴)) = (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
8 vex 3434 . . . . 5 𝑥 ∈ V
9 vex 3434 . . . . 5 𝑦 ∈ V
10 vex 3434 . . . . 5 𝑧 ∈ V
11 ot2ndg 7950 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦)
128, 9, 10, 11mp3an 1464 . . . 4 (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦
137, 12eqtr2di 2789 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑦 = (2nd ‘(1st𝐴)))
14 sbceq1a 3740 . . 3 (𝑦 = (2nd ‘(1st𝐴)) → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
1513, 14syl 17 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
16 2fveq3 6839 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (1st ‘(1st𝐴)) = (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
17 ot1stg 7949 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥)
188, 9, 10, 17mp3an 1464 . . . 4 (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥
1916, 18eqtr2di 2789 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑥 = (1st ‘(1st𝐴)))
20 sbceq1a 3740 . . 3 (𝑥 = (1st ‘(1st𝐴)) → ([(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑[(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
2119, 20syl 17 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑[(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
226, 15, 213bitrrd 306 1 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206   = wceq 1542  wcel 2114  Vcvv 3430  [wsbc 3729  cotp 4576  cfv 6492  1st c1st 7933  2nd c2nd 7934
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-sbc 3730  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-ot 4577  df-uni 4852  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-1st 7935  df-2nd 7936
This theorem is referenced by:  ralxp3es  8082  frpoins3xp3g  8084
  Copyright terms: Public domain W3C validator