| 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 7746 | . . . . 5 ⊢ (𝐴 ∈ V → ∪ 𝐴 ∈ V) | |
| 2 | 1 | pwexd 5341 | . . . 4 ⊢ (𝐴 ∈ V → 𝒫 ∪ 𝐴 ∈ V) |
| 3 | pwuni 4906 | . . . 4 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
| 4 | fiss 9400 | . . . 4 ⊢ ((𝒫 ∪ 𝐴 ∈ V ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴) → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) | |
| 5 | 2, 3, 4 | sylancl 598 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) |
| 6 | ssinss1 4191 | . . . . . . 7 ⊢ (𝑥 ⊆ ∪ 𝐴 → (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) | |
| 7 | vex 3455 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 8 | 7 | elpw 4561 | . . . . . . 7 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 ↔ 𝑥 ⊆ ∪ 𝐴) |
| 9 | 7 | inex1 5277 | . . . . . . . 8 ⊢ (𝑥 ∩ 𝑦) ∈ V |
| 10 | 9 | elpw 4561 | . . . . . . 7 ⊢ ((𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) |
| 11 | 6, 8, 10 | 3imtr4i 295 | . . . . . 6 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
| 12 | 11 | adantr 486 | . . . . 5 ⊢ ((𝑥 ∈ 𝒫 ∪ 𝐴 ∧ 𝑦 ∈ 𝒫 ∪ 𝐴) → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
| 13 | 12 | rgen2 3203 | . . . 4 ⊢ ∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 |
| 14 | inficl 9401 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) | |
| 15 | 2, 14 | syl 18 | . . . 4 ⊢ (𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) |
| 16 | 13, 15 | mpbii 236 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴) |
| 17 | 5, 16 | sseqtrd 3967 | . 2 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴) |
| 18 | fvprc 6869 | . . 3 ⊢ (¬ 𝐴 ∈ V → (fi‘𝐴) = ∅) | |
| 19 | 0ss 4350 | . . 3 ⊢ ∅ ⊆ 𝒫 ∪ 𝐴 | |
| 20 | 18, 19 | eqsstrdi 3975 | . 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 1570 ∈ wcel 2145 ∀wral 3077 Vcvv 3451 ∩ cin 3898 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 ∪ cuni 4867 ‘cfv 6531 ficfi 9386 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-om 7867 df-1o 8460 df-2o 8461 df-en 8958 df-fin 8961 df-fi 9387 |
| This theorem is used by: fiuni 9404 ordtbas 23490 |
| Copyright terms: Public domain | W3C validator |