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

Theorem sbcoteq1a 8005
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 6842 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd𝐴) = (2nd ‘⟨𝑥, 𝑦, 𝑧⟩))
2 ot3rdg 7959 . . . . 5 (𝑧 ∈ V → (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧)
32elv 3447 . . . 4 (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧
41, 3eqtr2di 2789 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑧 = (2nd𝐴))
5 sbceq1a 3753 . . 3 (𝑧 = (2nd𝐴) → (𝜑[(2nd𝐴) / 𝑧]𝜑))
64, 5syl 17 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝜑[(2nd𝐴) / 𝑧]𝜑))
7 2fveq3 6847 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘(1st𝐴)) = (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
8 vex 3446 . . . . 5 𝑥 ∈ V
9 vex 3446 . . . . 5 𝑦 ∈ V
10 vex 3446 . . . . 5 𝑧 ∈ V
11 ot2ndg 7958 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦)
128, 9, 10, 11mp3an 1464 . . . 4 (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦
137, 12eqtr2di 2789 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑦 = (2nd ‘(1st𝐴)))
14 sbceq1a 3753 . . 3 (𝑦 = (2nd ‘(1st𝐴)) → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
1513, 14syl 17 . 2 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
16 2fveq3 6847 . . . 4 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (1st ‘(1st𝐴)) = (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
17 ot1stg 7957 . . . . 5 ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥)
188, 9, 10, 17mp3an 1464 . . . 4 (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥
1916, 18eqtr2di 2789 . . 3 (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑥 = (1st ‘(1st𝐴)))
20 sbceq1a 3753 . . 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 3442  [wsbc 3742  cotp 4590  cfv 6500  1st c1st 7941  2nd c2nd 7942
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 5243  ax-nul 5253  ax-pr 5379  ax-un 7690
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 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-ot 4591  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-iota 6456  df-fun 6502  df-fv 6508  df-1st 7943  df-2nd 7944
This theorem is referenced by:  ralxp3es  8091  frpoins3xp3g  8093
  Copyright terms: Public domain W3C validator