Theorem fiuni 7037

Description: The union of the finite intersections of a set is simply the union of the set itself. (Contributed by Jeff Hankins, 5-Sep-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)

Assertion

Ref	Expression
fiuni	⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 = ∪ (fi‘𝐴))

Proof of Theorem fiuni

Dummy variables 𝑥 𝑦 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssfii 7033	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ⊆ (fi‘𝐴))
2	1	unissd 3859	. 2 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ⊆ ∪ (fi‘𝐴))
3		eluni 3838	. . . . 5 ⊢ (𝑥 ∈ ∪ (fi‘𝐴) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴)))
4	3	biimpi 120	. . . 4 ⊢ (𝑥 ∈ ∪ (fi‘𝐴) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴)))
5	4	adantl 277	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴)))
6		simprr 531	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) → 𝑦 ∈ (fi‘𝐴))
7		elfi2 7031	. . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ (fi‘𝐴) ↔ ∃𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅})𝑦 = ∩ 𝑧))
8	7	ad2antrr 488	. . . . 5 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) → (𝑦 ∈ (fi‘𝐴) ↔ ∃𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅})𝑦 = ∩ 𝑧))
9	6, 8	mpbid 147	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) → ∃𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅})𝑦 = ∩ 𝑧)
10		simprr 531	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → 𝑦 = ∩ 𝑧)
11		eldifi 3281	. . . . . . . . . 10 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → 𝑧 ∈ (𝒫 𝐴 ∩ Fin))
12	11	elin1d 3348	. . . . . . . . 9 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → 𝑧 ∈ 𝒫 𝐴)
13	12	elpwid 3612	. . . . . . . 8 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → 𝑧 ⊆ 𝐴)
14	13	ad2antrl 490	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → 𝑧 ⊆ 𝐴)
15		eldifsni 3747	. . . . . . . . 9 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → 𝑧 ≠ ∅)
16	11	elin2d 3349	. . . . . . . . . 10 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → 𝑧 ∈ Fin)
17		fin0 6941	. . . . . . . . . 10 ⊢ (𝑧 ∈ Fin → (𝑧 ≠ ∅ ↔ ∃𝑤 𝑤 ∈ 𝑧))
18	16, 17	syl 14	. . . . . . . . 9 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → (𝑧 ≠ ∅ ↔ ∃𝑤 𝑤 ∈ 𝑧))
19	15, 18	mpbid 147	. . . . . . . 8 ⊢ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) → ∃𝑤 𝑤 ∈ 𝑧)
20	19	ad2antrl 490	. . . . . . 7 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → ∃𝑤 𝑤 ∈ 𝑧)
21		intssuni2m 3894	. . . . . . 7 ⊢ ((𝑧 ⊆ 𝐴 ∧ ∃𝑤 𝑤 ∈ 𝑧) → ∩ 𝑧 ⊆ ∪ 𝐴)
22	14, 20, 21	syl2anc 411	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → ∩ 𝑧 ⊆ ∪ 𝐴)
23	10, 22	eqsstrd 3215	. . . . 5 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → 𝑦 ⊆ ∪ 𝐴)
24		simplrl 535	. . . . 5 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → 𝑥 ∈ 𝑦)
25	23, 24	sseldd 3180	. . . 4 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) ∧ (𝑧 ∈ ((𝒫 𝐴 ∩ Fin) ∖ {∅}) ∧ 𝑦 = ∩ 𝑧)) → 𝑥 ∈ ∪ 𝐴)
26	9, 25	rexlimddv 2616	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) ∧ (𝑥 ∈ 𝑦 ∧ 𝑦 ∈ (fi‘𝐴))) → 𝑥 ∈ ∪ 𝐴)
27	5, 26	exlimddv 1910	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 ∈ ∪ (fi‘𝐴)) → 𝑥 ∈ ∪ 𝐴)
28	2, 27	eqelssd 3198	1 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 = ∪ (fi‘𝐴))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364  ∃wex 1503   ∈ wcel 2164   ≠ wne 2364  ∃wrex 2473   ∖ cdif 3150   ∩ cin 3152   ⊆ wss 3153  ∅c0 3446  𝒫 cpw 3601  {csn 3618  ∪ cuni 3835  ∩ cint 3870  ‘cfv 5254  Fincfn 6794  ficfi 7027

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-iinf 4620

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-1o 6469  df-er 6587  df-en 6795  df-fin 6797  df-fi 7028

This theorem is referenced by:  fipwssg  7038