Theorem iunpw 7496

Description: An indexed union of a power class in terms of the power class of the union of its index. Part of Exercise 24(b) of [Enderton] p. 33. (Contributed by NM, 29-Nov-2003.)

Hypothesis

Ref	Expression
iunpw.1	⊢ 𝐴 ∈ V

Assertion

Ref	Expression
iunpw	⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 ↔ 𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥)

Distinct variable group:   𝑥,𝐴

Proof of Theorem iunpw

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq2 3996	. . . . . . . 8 ⊢ (𝑥 = ∪ 𝐴 → (𝑦 ⊆ 𝑥 ↔ 𝑦 ⊆ ∪ 𝐴))
2	1	biimprcd 252	. . . . . . 7 ⊢ (𝑦 ⊆ ∪ 𝐴 → (𝑥 = ∪ 𝐴 → 𝑦 ⊆ 𝑥))
3	2	reximdv 3276	. . . . . 6 ⊢ (𝑦 ⊆ ∪ 𝐴 → (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 → ∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
4	3	com12 32	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 → (𝑦 ⊆ ∪ 𝐴 → ∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
5		ssiun 4973	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥 → 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 𝑥)
6		uniiun 4985	. . . . . 6 ⊢ ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝑥
7	5, 6	sseqtrrdi 4021	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥 → 𝑦 ⊆ ∪ 𝐴)
8	4, 7	impbid1 227	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 → (𝑦 ⊆ ∪ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥))
9		velpw 4547	. . . 4 ⊢ (𝑦 ∈ 𝒫 ∪ 𝐴 ↔ 𝑦 ⊆ ∪ 𝐴)
10		eliun 4926	. . . . 5 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝒫 𝑥)
11		velpw 4547	. . . . . 6 ⊢ (𝑦 ∈ 𝒫 𝑥 ↔ 𝑦 ⊆ 𝑥)
12	11	rexbii 3250	. . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝑦 ∈ 𝒫 𝑥 ↔ ∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥)
13	10, 12	bitri 277	. . . 4 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 ↔ ∃𝑥 ∈ 𝐴 𝑦 ⊆ 𝑥)
14	8, 9, 13	3bitr4g 316	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 → (𝑦 ∈ 𝒫 ∪ 𝐴 ↔ 𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥))
15	14	eqrdv 2822	. 2 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 → 𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥)
16		ssid 3992	. . . . 5 ⊢ ∪ 𝐴 ⊆ ∪ 𝐴
17		iunpw.1	. . . . . . . 8 ⊢ 𝐴 ∈ V
18	17	uniex 7470	. . . . . . 7 ⊢ ∪ 𝐴 ∈ V
19	18	elpw 4546	. . . . . 6 ⊢ (∪ 𝐴 ∈ 𝒫 ∪ 𝐴 ↔ ∪ 𝐴 ⊆ ∪ 𝐴)
20		eleq2 2904	. . . . . 6 ⊢ (𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 → (∪ 𝐴 ∈ 𝒫 ∪ 𝐴 ↔ ∪ 𝐴 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥))
21	19, 20	syl5bbr 287	. . . . 5 ⊢ (𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 → (∪ 𝐴 ⊆ ∪ 𝐴 ↔ ∪ 𝐴 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥))
22	16, 21	mpbii 235	. . . 4 ⊢ (𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 → ∪ 𝐴 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥)
23		eliun 4926	. . . 4 ⊢ (∪ 𝐴 ∈ ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 ↔ ∃𝑥 ∈ 𝐴 ∪ 𝐴 ∈ 𝒫 𝑥)
24	22, 23	sylib 220	. . 3 ⊢ (𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 → ∃𝑥 ∈ 𝐴 ∪ 𝐴 ∈ 𝒫 𝑥)
25		elssuni 4871	. . . . . . 7 ⊢ (𝑥 ∈ 𝐴 → 𝑥 ⊆ ∪ 𝐴)
26		elpwi 4551	. . . . . . 7 ⊢ (∪ 𝐴 ∈ 𝒫 𝑥 → ∪ 𝐴 ⊆ 𝑥)
27	25, 26	anim12i 614	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ ∪ 𝐴 ∈ 𝒫 𝑥) → (𝑥 ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑥))
28		eqss 3985	. . . . . 6 ⊢ (𝑥 = ∪ 𝐴 ↔ (𝑥 ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ 𝑥))
29	27, 28	sylibr 236	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ ∪ 𝐴 ∈ 𝒫 𝑥) → 𝑥 = ∪ 𝐴)
30	29	ex 415	. . . 4 ⊢ (𝑥 ∈ 𝐴 → (∪ 𝐴 ∈ 𝒫 𝑥 → 𝑥 = ∪ 𝐴))
31	30	reximia 3245	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∪ 𝐴 ∈ 𝒫 𝑥 → ∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴)
32	24, 31	syl 17	. 2 ⊢ (𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥 → ∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴)
33	15, 32	impbii 211	1 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝐴 ↔ 𝒫 ∪ 𝐴 = ∪ 𝑥 ∈ 𝐴 𝒫 𝑥)

Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1536   ∈ wcel 2113  ∃wrex 3142  Vcvv 3497   ⊆ wss 3939  𝒫 cpw 4542  ∪ cuni 4841  ∪ ciun 4922

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-un 7464

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-rex 3147  df-v 3499  df-in 3946  df-ss 3955  df-pw 4544  df-uni 4842  df-iun 4924

This theorem is referenced by: (None)