Theorem sbcoteq1a 8030

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 6881	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘𝐴) = (2nd ‘⟨𝑥, 𝑦, 𝑧⟩))
2		ot3rdg 7984	. . . . 5 ⊢ (𝑧 ∈ V → (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧)
3	2	elv 3472	. . . 4 ⊢ (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧
4	1, 3	eqtr2di 2781	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑧 = (2nd ‘𝐴))
5		sbceq1a 3780	. . 3 ⊢ (𝑧 = (2nd ‘𝐴) → (𝜑 ↔ [(2nd ‘𝐴) / 𝑧]𝜑))
6	4, 5	syl 17	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝜑 ↔ [(2nd ‘𝐴) / 𝑧]𝜑))
7		2fveq3 6886	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘(1st ‘𝐴)) = (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
8		vex 3470	. . . . 5 ⊢ 𝑥 ∈ V
9		vex 3470	. . . . 5 ⊢ 𝑦 ∈ V
10		vex 3470	. . . . 5 ⊢ 𝑧 ∈ V
11		ot2ndg 7983	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦)
12	8, 9, 10, 11	mp3an 1457	. . . 4 ⊢ (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦
13	7, 12	eqtr2di 2781	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑦 = (2nd ‘(1st ‘𝐴)))
14		sbceq1a 3780	. . 3 ⊢ (𝑦 = (2nd ‘(1st ‘𝐴)) → ([(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
15	13, 14	syl 17	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
16		2fveq3 6886	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (1st ‘(1st ‘𝐴)) = (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
17		ot1stg 7982	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥)
18	8, 9, 10, 17	mp3an 1457	. . . 4 ⊢ (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥
19	16, 18	eqtr2di 2781	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑥 = (1st ‘(1st ‘𝐴)))
20		sbceq1a 3780	. . 3 ⊢ (𝑥 = (1st ‘(1st ‘𝐴)) → ([(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(1st ‘(1st ‘𝐴)) / 𝑥][(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
21	19, 20	syl 17	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(1st ‘(1st ‘𝐴)) / 𝑥][(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
22	6, 15, 21	3bitrrd 306	1 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(1st ‘(1st ‘𝐴)) / 𝑥][(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑 ↔ 𝜑))

Syntax hints:   → wi 4   ↔ wb 205   = wceq 1533   ∈ wcel 2098  Vcvv 3466  [wsbc 3769  ⟨cotp 4628  ‘cfv 6533  1^st c1st 7966  2^nd c2nd 7967

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2695  ax-sep 5289  ax-nul 5296  ax-pr 5417  ax-un 7718

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2526  df-eu 2555  df-clab 2702  df-cleq 2716  df-clel 2802  df-nfc 2877  df-ral 3054  df-rex 3063  df-rab 3425  df-v 3468  df-sbc 3770  df-dif 3943  df-un 3945  df-in 3947  df-ss 3957  df-nul 4315  df-if 4521  df-sn 4621  df-pr 4623  df-op 4627  df-ot 4629  df-uni 4900  df-br 5139  df-opab 5201  df-mpt 5222  df-id 5564  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-iota 6485  df-fun 6535  df-fv 6541  df-1st 7968  df-2nd 7969

This theorem is referenced by:  ralxp3es  8119  frpoins3xp3g  8121