Theorem sbcreu 3515

Description: Interchange class substitution and restricted uniqueness quantifier. (Contributed by NM, 24-Feb-2013.) (Revised by NM, 18-Aug-2018.)

Assertion

Ref	Expression
sbcreu	⊢ ([𝐴 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑)

Distinct variable groups:   𝑦,𝐴   𝑥,𝐵   𝑥,𝑦

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

Proof of Theorem sbcreu

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sbcex 3445	. 2 ⊢ ([𝐴 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑 → 𝐴 ∈ V)
2		reurex 3160	. . 3 ⊢ (∃!𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑 → ∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑)
3		sbcex 3445	. . . 4 ⊢ ([𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)
4	3	rexlimivw 3029	. . 3 ⊢ (∃𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)
5	2, 4	syl 17	. 2 ⊢ (∃!𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑 → 𝐴 ∈ V)
6		dfsbcq2 3438	. . 3 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑 ↔ [𝐴 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑))
7		dfsbcq2 3438	. . . 4 ⊢ (𝑧 = 𝐴 → ([𝑧 / 𝑥]𝜑 ↔ [𝐴 / 𝑥]𝜑))
8	7	reubidv 3126	. . 3 ⊢ (𝑧 = 𝐴 → (∃!𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑 ↔ ∃!𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
9		nfcv 2764	. . . . 5 ⊢ Ⅎ𝑥𝐵
10		nfs1v 2437	. . . . 5 ⊢ Ⅎ𝑥[𝑧 / 𝑥]𝜑
11	9, 10	nfreu 3114	. . . 4 ⊢ Ⅎ𝑥∃!𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑
12		sbequ12 2111	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝜑 ↔ [𝑧 / 𝑥]𝜑))
13	12	reubidv 3126	. . . 4 ⊢ (𝑥 = 𝑧 → (∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑))
14	11, 13	sbie 2408	. . 3 ⊢ ([𝑧 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐵 [𝑧 / 𝑥]𝜑)
15	6, 8, 14	vtoclbg 3267	. 2 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑))
16	1, 5, 15	pm5.21nii 368	1 ⊢ ([𝐴 / 𝑥]∃!𝑦 ∈ 𝐵 𝜑 ↔ ∃!𝑦 ∈ 𝐵 [𝐴 / 𝑥]𝜑)

Syntax hints:   ↔ wb 196   = wceq 1483  [wsb 1880   ∈ wcel 1990  ∃wrex 2913  ∃!wreu 2914  Vcvv 3200  [wsbc 3435

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-v 3202  df-sbc 3436

This theorem is referenced by: (None)