Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sbcoteq1a Structured version   Visualization version   GIF version

Theorem sbcoteq1a 33687
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 opex 5379 . . . . 5 𝑥, 𝑦⟩ ∈ V
2 vex 3436 . . . . 5 𝑧 ∈ V
31, 2op2ndd 7842 . . . 4 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (2nd𝐴) = 𝑧)
43eqcomd 2744 . . 3 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → 𝑧 = (2nd𝐴))
5 sbceq1a 3727 . . 3 (𝑧 = (2nd𝐴) → (𝜑[(2nd𝐴) / 𝑧]𝜑))
64, 5syl 17 . 2 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (𝜑[(2nd𝐴) / 𝑧]𝜑))
7 vex 3436 . . . . 5 𝑥 ∈ V
8 vex 3436 . . . . 5 𝑦 ∈ V
97, 8, 2ot22ndd 33681 . . . 4 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (2nd ‘(1st𝐴)) = 𝑦)
109eqcomd 2744 . . 3 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → 𝑦 = (2nd ‘(1st𝐴)))
11 sbceq1a 3727 . . 3 (𝑦 = (2nd ‘(1st𝐴)) → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
1210, 11syl 17 . 2 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → ([(2nd𝐴) / 𝑧]𝜑[(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
137, 8, 2ot21std 33680 . . . 4 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → (1st ‘(1st𝐴)) = 𝑥)
1413eqcomd 2744 . . 3 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → 𝑥 = (1st ‘(1st𝐴)))
15 sbceq1a 3727 . . 3 (𝑥 = (1st ‘(1st𝐴)) → ([(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑[(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
1614, 15syl 17 . 2 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → ([(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑[(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑))
176, 12, 163bitrrd 306 1 (𝐴 = ⟨⟨𝑥, 𝑦⟩, 𝑧⟩ → ([(1st ‘(1st𝐴)) / 𝑥][(2nd ‘(1st𝐴)) / 𝑦][(2nd𝐴) / 𝑧]𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205   = wceq 1539  [wsbc 3716  cop 4567  cfv 6433  1st c1st 7829  2nd c2nd 7830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fv 6441  df-1st 7831  df-2nd 7832
This theorem is referenced by:  ralxp3es  33688  frpoins3xp3g  33788
  Copyright terms: Public domain W3C validator