| 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 7757 | . . . . 5 ⊢ (𝐴 ∈ V → ∪ 𝐴 ∈ V) | |
| 2 | 1 | pwexd 5340 | . . . 4 ⊢ (𝐴 ∈ V → 𝒫 ∪ 𝐴 ∈ V) |
| 3 | pwuni 4905 | . . . 4 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
| 4 | fiss 9419 | . . . 4 ⊢ ((𝒫 ∪ 𝐴 ∈ V ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴) → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) | |
| 5 | 2, 3, 4 | sylancl 598 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) |
| 6 | ssinss1 4142 | . . . . . . 7 ⊢ (𝑥 ⊆ ∪ 𝐴 → (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) | |
| 7 | vex 3454 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 8 | 7 | elpw 4560 | . . . . . . 7 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 ↔ 𝑥 ⊆ ∪ 𝐴) |
| 9 | 7 | inex1 5276 | . . . . . . . 8 ⊢ (𝑥 ∩ 𝑦) ∈ V |
| 10 | 9 | elpw 4560 | . . . . . . 7 ⊢ ((𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) |
| 11 | 6, 8, 10 | 3imtr4i 295 | . . . . . 6 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
| 12 | 11 | adantr 486 | . . . . 5 ⊢ ((𝑥 ∈ 𝒫 ∪ 𝐴 ∧ 𝑦 ∈ 𝒫 ∪ 𝐴) → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
| 13 | 12 | rgen2 3202 | . . . 4 ⊢ ∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 |
| 14 | inficl 9420 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) | |
| 15 | 2, 14 | syl 18 | . . . 4 ⊢ (𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) |
| 16 | 13, 15 | mpbii 236 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴) |
| 17 | 5, 16 | sseqtrd 3944 | . 2 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴) |
| 18 | fvprc 6877 | . . 3 ⊢ (¬ 𝐴 ∈ V → (fi‘𝐴) = ∅) | |
| 19 | 0ss 4349 | . . 3 ⊢ ∅ ⊆ 𝒫 ∪ 𝐴 | |
| 20 | 18, 19 | eqsstrdi 3952 | . 2 ⊢ (¬ 𝐴 ∈ V → (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴) |
| 21 | 17, 20 | pm2.61i 184 | 1 ⊢ (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴 |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 ↔ wb 209 = wceq 1569 ∈ wcel 2144 ∀wral 3076 Vcvv 3450 ⊆ wss 3895 ∩ cin 4089 ∅c0 4278 𝒫 cpw 4556 ∪ cuni 4866 ‘cfv 6538 ficfi 9405 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-om 7878 df-1o 8479 df-2o 8480 df-en 8977 df-fin 8980 df-fi 9406 |
| This theorem is used by: fiuni 9423 ordtbas 23515 |
| Copyright terms: Public domain | W3C validator |