Theorem elunif 45954

Description: A version of eluni 4869 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
elunif.1	⊢ Ⅎ𝑥𝐴
elunif.2	⊢ Ⅎ𝑥𝐵

Assertion

Ref	Expression
elunif	⊢ (𝐴 ∈ ∪ 𝐵 ↔ ∃𝑥(𝐴 ∈ 𝑥 ∧ 𝑥 ∈ 𝐵))

Distinct variable group:   𝐴,𝐵

Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem elunif

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluni 4869	. 2 ⊢ (𝐴 ∈ ∪ 𝐵 ↔ ∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵))
2		elunif.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
3		nfcv 2922	. . . . 5 ⊢ Ⅎ𝑥𝑦
4	2, 3	nfel 2936	. . . 4 ⊢ Ⅎ𝑥 𝐴 ∈ 𝑦
5		elunif.2	. . . . 5 ⊢ Ⅎ𝑥𝐵
6	3, 5	nfel 2936	. . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵
7	4, 6	nfan 1932	. . 3 ⊢ Ⅎ𝑥(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵)
8		nfv 1947	. . 3 ⊢ Ⅎ𝑦(𝐴 ∈ 𝑥 ∧ 𝑥 ∈ 𝐵)
9		eleq2w 2844	. . . 4 ⊢ (𝑦 = 𝑥 → (𝐴 ∈ 𝑦 ↔ 𝐴 ∈ 𝑥))
10		eleq1w 2843	. . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
11	9, 10	anbi12d 644	. . 3 ⊢ (𝑦 = 𝑥 → ((𝐴 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) ↔ (𝐴 ∈ 𝑥 ∧ 𝑥 ∈ 𝐵)))
12	7, 8, 11	cbvexv1 2371	. 2 ⊢ (∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ 𝐵) ↔ ∃𝑥(𝐴 ∈ 𝑥 ∧ 𝑥 ∈ 𝐵))
13	1, 12	bitri 278	1 ⊢ (𝐴 ∈ ∪ 𝐵 ↔ ∃𝑥(𝐴 ∈ 𝑥 ∧ 𝑥 ∈ 𝐵))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401  ∃wex 1812   ∈ wcel 2145  Ⅎwnfc 2907  ∪ cuni 4866

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-ext 2732

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 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-v 3452  df-uni 4867

This theorem is used by:  eluni2f  46039  stoweidlem46  46978  stoweidlem57  46989