Theorem cbvrexcsf 3890

Description: A more general version of cbvrexf 3347 that has no distinct variable restrictions. Changes bound variables using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2402. (Contributed by Andrew Salmon, 13-Jul-2011.) (Proof shortened by Mario Carneiro, 7-Dec-2014.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cbvralcsf.1	⊢ Ⅎ𝑦𝐴
cbvralcsf.2	⊢ Ⅎ𝑥𝐵
cbvralcsf.3	⊢ Ⅎ𝑦𝜑
cbvralcsf.4	⊢ Ⅎ𝑥𝜓
cbvralcsf.5	⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
cbvralcsf.6	⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
cbvrexcsf	⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓)

Proof of Theorem cbvrexcsf

Step	Hyp	Ref	Expression
1		cbvralcsf.1	. . . 4 ⊢ Ⅎ𝑦𝐴
2		cbvralcsf.2	. . . 4 ⊢ Ⅎ𝑥𝐵
3		cbvralcsf.3	. . . . 5 ⊢ Ⅎ𝑦𝜑
4	3	nfn 1890	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜑
5		cbvralcsf.4	. . . . 5 ⊢ Ⅎ𝑥𝜓
6	5	nfn 1890	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
7		cbvralcsf.5	. . . 4 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
8		cbvralcsf.6	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
9	8	notbid 321	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓))
10	1, 2, 4, 6, 7, 9	cbvralcsf 3889	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝜓)
11	10	notbii 323	. 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜓)
12		dfrex2 3090	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑)
13		dfrex2 3090	. 2 ⊢ (∃𝑦 ∈ 𝐵 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜓)
14	11, 12, 13	3bitr4i 306	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   = wceq 1570  Ⅎwnf 1816  Ⅎwnfc 2908  ∀wral 3077  ∃wrex 3087

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-13 2402  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ral 3078  df-rex 3088  df-sbc 3740  df-csb 3848

This theorem is used by:  cbvrexv2  3894