Theorem cbvrexcsf 3930

Description: A more general version of cbvrexf 3345 that has no distinct variable restrictions. Changes bound variables using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2365. (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 1852	. . . 4 ⊢ Ⅎ𝑦 ¬ 𝜑
5		cbvralcsf.4	. . . . 5 ⊢ Ⅎ𝑥𝜓
6	5	nfn 1852	. . . 4 ⊢ Ⅎ𝑥 ¬ 𝜓
7		cbvralcsf.5	. . . 4 ⊢ (𝑥 = 𝑦 → 𝐴 = 𝐵)
8		cbvralcsf.6	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓))
9	8	notbid 317	. . . 4 ⊢ (𝑥 = 𝑦 → (¬ 𝜑 ↔ ¬ 𝜓))
10	1, 2, 4, 6, 7, 9	cbvralcsf 3929	. . 3 ⊢ (∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ∀𝑦 ∈ 𝐵 ¬ 𝜓)
11	10	notbii 319	. 2 ⊢ (¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜓)
12		dfrex2 3063	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 ¬ 𝜑)
13		dfrex2 3063	. 2 ⊢ (∃𝑦 ∈ 𝐵 𝜓 ↔ ¬ ∀𝑦 ∈ 𝐵 ¬ 𝜓)
14	11, 12, 13	3bitr4i 302	1 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑦 ∈ 𝐵 𝜓)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 205   = wceq 1533  Ⅎwnf 1777  Ⅎwnfc 2875  ∀wral 3051  ∃wrex 3060

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-13 2365  ax-ext 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-tru 1536  df-ex 1774  df-nf 1778  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ral 3052  df-rex 3061  df-sbc 3769  df-csb 3885

This theorem is referenced by:  cbvrexv2  3934