Theorem sbcoteq1a 8050

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

Step	Hyp	Ref	Expression
1		fveq2 6885	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘𝐴) = (2nd ‘⟨𝑥, 𝑦, 𝑧⟩))
2		ot3rdg 8004	. . . . 5 ⊢ (𝑧 ∈ V → (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧)
3	2	elv 3462	. . . 4 ⊢ (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧
4	1, 3	eqtr2di 2817	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑧 = (2nd ‘𝐴))
5		sbceq1a 3757	. . 3 ⊢ (𝑧 = (2nd ‘𝐴) → (𝜑 ↔ [(2nd ‘𝐴) / 𝑧]𝜑))
6	4, 5	syl 18	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝜑 ↔ [(2nd ‘𝐴) / 𝑧]𝜑))
7		2fveq3 6890	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘(1st ‘𝐴)) = (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
8		vex 3461	. . . . 5 ⊢ 𝑥 ∈ V
9		vex 3461	. . . . 5 ⊢ 𝑦 ∈ V
10		vex 3461	. . . . 5 ⊢ 𝑧 ∈ V
11		ot2ndg 8003	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦)
12	8, 9, 10, 11	mp3an 1490	. . . 4 ⊢ (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦
13	7, 12	eqtr2di 2817	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑦 = (2nd ‘(1st ‘𝐴)))
14		sbceq1a 3757	. . 3 ⊢ (𝑦 = (2nd ‘(1st ‘𝐴)) → ([(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
15	13, 14	syl 18	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
16		2fveq3 6890	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (1st ‘(1st ‘𝐴)) = (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
17		ot1stg 8002	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥)
18	8, 9, 10, 17	mp3an 1490	. . . 4 ⊢ (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥
19	16, 18	eqtr2di 2817	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑥 = (1st ‘(1st ‘𝐴)))
20		sbceq1a 3757	. . 3 ⊢ (𝑥 = (1st ‘(1st ‘𝐴)) → ([(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(1st ‘(1st ‘𝐴)) / 𝑥][(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
21	19, 20	syl 18	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(1st ‘(1st ‘𝐴)) / 𝑥][(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
22	6, 15, 21	3bitrrd 309	1 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(1st ‘(1st ‘𝐴)) / 𝑥][(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑 ↔ 𝜑))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∈ wcel 2146  Vcvv 3457  [wsbc 3746  ⟨cotp 4599  ‘cfv 6540  1^st c1st 7986  2^nd c2nd 7987

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406  ax-un 7738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-sbc 3747  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-ot 4600  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-iota 6496  df-fun 6542  df-fv 6548  df-1st 7988  df-2nd 7989

This theorem is used by:  ralxp3es  8137  frpoins3xp3g  8139