Theorem sbcoteq1a 8097

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 6916	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘𝐴) = (2nd ‘⟨𝑥, 𝑦, 𝑧⟩))
2		ot3rdg 8051	. . . . 5 ⊢ (𝑧 ∈ V → (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧)
3	2	elv 3459	. . . 4 ⊢ (2nd ‘⟨𝑥, 𝑦, 𝑧⟩) = 𝑧
4	1, 3	eqtr2di 2815	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑧 = (2nd ‘𝐴))
5		sbceq1a 3753	. . 3 ⊢ (𝑧 = (2nd ‘𝐴) → (𝜑 ↔ [(2nd ‘𝐴) / 𝑧]𝜑))
6	4, 5	syl 18	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (𝜑 ↔ [(2nd ‘𝐴) / 𝑧]𝜑))
7		2fveq3 6921	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (2nd ‘(1st ‘𝐴)) = (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
8		vex 3458	. . . . 5 ⊢ 𝑥 ∈ V
9		vex 3458	. . . . 5 ⊢ 𝑦 ∈ V
10		vex 3458	. . . . 5 ⊢ 𝑧 ∈ V
11		ot2ndg 8050	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦)
12	8, 9, 10, 11	mp3an 1491	. . . 4 ⊢ (2nd ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑦
13	7, 12	eqtr2di 2815	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑦 = (2nd ‘(1st ‘𝐴)))
14		sbceq1a 3753	. . 3 ⊢ (𝑦 = (2nd ‘(1st ‘𝐴)) → ([(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
15	13, 14	syl 18	. 2 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → ([(2nd ‘𝐴) / 𝑧]𝜑 ↔ [(2nd ‘(1st ‘𝐴)) / 𝑦][(2nd ‘𝐴) / 𝑧]𝜑))
16		2fveq3 6921	. . . 4 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → (1st ‘(1st ‘𝐴)) = (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)))
17		ot1stg 8049	. . . . 5 ⊢ ((𝑥 ∈ V ∧ 𝑦 ∈ V ∧ 𝑧 ∈ V) → (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥)
18	8, 9, 10, 17	mp3an 1491	. . . 4 ⊢ (1st ‘(1st ‘⟨𝑥, 𝑦, 𝑧⟩)) = 𝑥
19	16, 18	eqtr2di 2815	. . 3 ⊢ (𝐴 = ⟨𝑥, 𝑦, 𝑧⟩ → 𝑥 = (1st ‘(1st ‘𝐴)))
20		sbceq1a 3753	. . 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 2147  Vcvv 3454  [wsbc 3742  ⟨cotp 4863  ‘cfv 6566  1^st c1st 8033  2^nd c2nd 8034

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-ot 4864  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-1st 8035  df-2nd 8036

This theorem is used by:  ralxp3es  8193  frpoins3xp3g  8195