Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fipwuni | Structured version Visualization version GIF version |
Description: The set of finite intersections of a set is contained in the powerset of the union of the elements of 𝐴. (Contributed by Mario Carneiro, 24-Nov-2013.) (Proof shortened by Mario Carneiro, 21-Mar-2015.) |
Ref | Expression |
---|---|
fipwuni | ⊢ (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uniexg 7446 | . . . . 5 ⊢ (𝐴 ∈ V → ∪ 𝐴 ∈ V) | |
2 | 1 | pwexd 5245 | . . . 4 ⊢ (𝐴 ∈ V → 𝒫 ∪ 𝐴 ∈ V) |
3 | pwuni 4837 | . . . 4 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
4 | fiss 8872 | . . . 4 ⊢ ((𝒫 ∪ 𝐴 ∈ V ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴) → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) | |
5 | 2, 3, 4 | sylancl 589 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) |
6 | ssinss1 4164 | . . . . . . 7 ⊢ (𝑥 ⊆ ∪ 𝐴 → (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) | |
7 | vex 3444 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
8 | 7 | elpw 4501 | . . . . . . 7 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 ↔ 𝑥 ⊆ ∪ 𝐴) |
9 | 7 | inex1 5185 | . . . . . . . 8 ⊢ (𝑥 ∩ 𝑦) ∈ V |
10 | 9 | elpw 4501 | . . . . . . 7 ⊢ ((𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) |
11 | 6, 8, 10 | 3imtr4i 295 | . . . . . 6 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
12 | 11 | adantr 484 | . . . . 5 ⊢ ((𝑥 ∈ 𝒫 ∪ 𝐴 ∧ 𝑦 ∈ 𝒫 ∪ 𝐴) → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
13 | 12 | rgen2 3168 | . . . 4 ⊢ ∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 |
14 | inficl 8873 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) | |
15 | 2, 14 | syl 17 | . . . 4 ⊢ (𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) |
16 | 13, 15 | mpbii 236 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴) |
17 | 5, 16 | sseqtrd 3955 | . 2 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴) |
18 | fvprc 6638 | . . 3 ⊢ (¬ 𝐴 ∈ V → (fi‘𝐴) = ∅) | |
19 | 0ss 4304 | . . 3 ⊢ ∅ ⊆ 𝒫 ∪ 𝐴 | |
20 | 18, 19 | eqsstrdi 3969 | . 2 ⊢ (¬ 𝐴 ∈ V → (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴) |
21 | 17, 20 | pm2.61i 185 | 1 ⊢ (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ↔ wb 209 = wceq 1538 ∈ wcel 2111 ∀wral 3106 Vcvv 3441 ∩ cin 3880 ⊆ wss 3881 ∅c0 4243 𝒫 cpw 4497 ∪ cuni 4800 ‘cfv 6324 ficfi 8858 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-oadd 8089 df-er 8272 df-en 8493 df-fin 8496 df-fi 8859 |
This theorem is referenced by: fiuni 8876 ordtbas 21797 |
Copyright terms: Public domain | W3C validator |