Theorem sbcralt 3818

Description: Interchange class substitution and restricted quantifier. (Contributed by NM, 1-Mar-2008.) (Revised by David Abernethy, 22-Feb-2010.)

Assertion

Ref	Expression
sbcralt	⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑦𝐴) → ([𝐴 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))

Distinct variable groups:   𝑥,𝑦   𝑥,𝐵

Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝐴(𝑥, 𝑦)   𝐵(𝑦)   𝑉(𝑥, 𝑦)

Proof of Theorem sbcralt

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbccow 3761	. 2 ⊢ ([𝐴 / 𝑧][𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ [𝐴 / 𝑥]∀𝑦 ∈ 𝐵 𝜑)
2		simpl 488	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑦𝐴) → 𝐴 ∈ 𝑉)
3		sbsbc 3742	. . . . 5 ⊢ ([𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ [𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑)
4		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑥𝐵
5		nfs1v 2192	. . . . . . 7 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
6	4, 5	nfralw 3309	. . . . . 6 ⊢ Ⅎ𝑥∀𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑
7		sbequ12 2286	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
8	7	ralbidv 3185	. . . . . 6 ⊢ (𝑥 = 𝑧 → (∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑))
9	6, 8	sbiev 2345	. . . . 5 ⊢ ([𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
10	3, 9	bitr3i 280	. . . 4 ⊢ ([𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
11		nfnfc1 2925	. . . . . . 7 ⊢ Ⅎ𝑦Ⅎ𝑦𝐴
12		nfcvd 2923	. . . . . . . 8 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦𝑧)
13		id 23	. . . . . . . 8 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦𝐴)
14	12, 13	nfeqd 2932	. . . . . . 7 ⊢ (Ⅎ𝑦𝐴 → Ⅎ𝑦 𝑧 = 𝐴)
15	11, 14	nfan1 2236	. . . . . 6 ⊢ Ⅎ𝑦(Ⅎ𝑦𝐴 ∧ 𝑧 = 𝐴)
16		dfsbcq2 3741	. . . . . . 7 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
17	16	adantl 487	. . . . . 6 ⊢ ((Ⅎ𝑦𝐴 ∧ 𝑧 = 𝐴) → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
18	15, 17	ralbid 3275	. . . . 5 ⊢ ((Ⅎ𝑦𝐴 ∧ 𝑧 = 𝐴) → (∀𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
19	18	adantll 727	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ Ⅎ𝑦𝐴) ∧ 𝑧 = 𝐴) → (∀𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
20	10, 19	bitrid 286	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ Ⅎ𝑦𝐴) ∧ 𝑧 = 𝐴) → ([𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
21	2, 20	sbcied 3781	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑦𝐴) → ([𝐴 / 𝑧][𝑧 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
22	1, 21	bitr3id 288	1 ⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑦𝐴) → ([𝐴 / 𝑥]∀𝑦 ∈ 𝐵 𝜑 ↔ ∀𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  [wsb 2098   ∈ wcel 2144  Ⅎwnfc 2907  ∀wral 3076  [wsbc 3738

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-v 3452  df-sbc 3739

This theorem is used by:  sbcrext  3819  sbcralg  3820  modelaxreplem3  46064