Theorem sbcie3s 16535

Description: A special version of class substitution commonly used for structures. (Contributed by Thierry Arnoux, 15-Mar-2019.)

Hypotheses

Ref	Expression
sbcie3s.a	⊢ 𝐴 = (𝐸‘𝑊)
sbcie3s.b	⊢ 𝐵 = (𝐹‘𝑊)
sbcie3s.c	⊢ 𝐶 = (𝐺‘𝑊)
sbcie3s.1	⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵 ∧ 𝑐 = 𝐶) → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
sbcie3s	⊢ (𝑤 = 𝑊 → ([(𝐸‘𝑤) / 𝑎][(𝐹‘𝑤) / 𝑏][(𝐺‘𝑤) / 𝑐]𝜓 ↔ 𝜑))

Distinct variable groups:   𝑎,𝑏,𝑐,𝑤   𝐸,𝑎,𝑏,𝑐   𝐹,𝑏,𝑐   𝐺,𝑐   𝑊,𝑎,𝑏,𝑐   𝜑,𝑎,𝑏,𝑐

Allowed substitution hints:   𝜑(𝑤)   𝜓(𝑤,𝑎,𝑏,𝑐)   𝐴(𝑤,𝑎,𝑏,𝑐)   𝐵(𝑤,𝑎,𝑏,𝑐)   𝐶(𝑤,𝑎,𝑏,𝑐)   𝐸(𝑤)   𝐹(𝑤,𝑎)   𝐺(𝑤,𝑎,𝑏)   𝑊(𝑤)

Proof of Theorem sbcie3s

Step	Hyp	Ref	Expression
1		fvexd 6679	. 2 ⊢ (𝑤 = 𝑊 → (𝐸‘𝑤) ∈ V)
2		fvexd 6679	. . 3 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → (𝐹‘𝑤) ∈ V)
3		fvexd 6679	. . . 4 ⊢ (((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) → (𝐺‘𝑤) ∈ V)
4		simpllr 774	. . . . . . . 8 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑎 = (𝐸‘𝑤))
5		fveq2 6664	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝐸‘𝑤) = (𝐸‘𝑊))
6	5	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → (𝐸‘𝑤) = (𝐸‘𝑊))
7	4, 6	eqtrd 2856	. . . . . . 7 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑎 = (𝐸‘𝑊))
8		sbcie3s.a	. . . . . . 7 ⊢ 𝐴 = (𝐸‘𝑊)
9	7, 8	syl6eqr 2874	. . . . . 6 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑎 = 𝐴)
10		simplr 767	. . . . . . . 8 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑏 = (𝐹‘𝑤))
11		fveq2 6664	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝐹‘𝑤) = (𝐹‘𝑊))
12	11	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → (𝐹‘𝑤) = (𝐹‘𝑊))
13	10, 12	eqtrd 2856	. . . . . . 7 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑏 = (𝐹‘𝑊))
14		sbcie3s.b	. . . . . . 7 ⊢ 𝐵 = (𝐹‘𝑊)
15	13, 14	syl6eqr 2874	. . . . . 6 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑏 = 𝐵)
16		simpr 487	. . . . . . . 8 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑐 = (𝐺‘𝑤))
17		fveq2 6664	. . . . . . . . 9 ⊢ (𝑤 = 𝑊 → (𝐺‘𝑤) = (𝐺‘𝑊))
18	17	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → (𝐺‘𝑤) = (𝐺‘𝑊))
19	16, 18	eqtrd 2856	. . . . . . 7 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑐 = (𝐺‘𝑊))
20		sbcie3s.c	. . . . . . 7 ⊢ 𝐶 = (𝐺‘𝑊)
21	19, 20	syl6eqr 2874	. . . . . 6 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → 𝑐 = 𝐶)
22		sbcie3s.1	. . . . . 6 ⊢ ((𝑎 = 𝐴 ∧ 𝑏 = 𝐵 ∧ 𝑐 = 𝐶) → (𝜑 ↔ 𝜓))
23	9, 15, 21, 22	syl3anc 1367	. . . . 5 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → (𝜑 ↔ 𝜓))
24	23	bicomd 225	. . . 4 ⊢ ((((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) ∧ 𝑐 = (𝐺‘𝑤)) → (𝜓 ↔ 𝜑))
25	3, 24	sbcied 3813	. . 3 ⊢ (((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) ∧ 𝑏 = (𝐹‘𝑤)) → ([(𝐺‘𝑤) / 𝑐]𝜓 ↔ 𝜑))
26	2, 25	sbcied 3813	. 2 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → ([(𝐹‘𝑤) / 𝑏][(𝐺‘𝑤) / 𝑐]𝜓 ↔ 𝜑))
27	1, 26	sbcied 3813	1 ⊢ (𝑤 = 𝑊 → ([(𝐸‘𝑤) / 𝑎][(𝐹‘𝑤) / 𝑏][(𝐺‘𝑤) / 𝑐]𝜓 ↔ 𝜑))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533  Vcvv 3494  [wsbc 3771  ‘cfv 6349

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-nul 5202

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-iota 6308  df-fv 6357

This theorem is referenced by:  istrkgcb  26236  istrkgld  26239  legval  26364  istrkg2d  31932  afsval  31937