| 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 5348 | . . . 4 ⊢ (𝐴 ∈ V → 𝒫 ∪ 𝐴 ∈ V) |
| 3 | pwuni 4909 | . . . 4 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
| 4 | fiss 9398 | . . . 4 ⊢ ((𝒫 ∪ 𝐴 ∈ V ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴) → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) | |
| 5 | 2, 3, 4 | sylancl 598 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ (fi‘𝒫 ∪ 𝐴)) |
| 6 | ssinss1 4194 | . . . . . . 7 ⊢ (𝑥 ⊆ ∪ 𝐴 → (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) | |
| 7 | vex 3457 | . . . . . . . 8 ⊢ 𝑥 ∈ V | |
| 8 | 7 | elpw 4564 | . . . . . . 7 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 ↔ 𝑥 ⊆ ∪ 𝐴) |
| 9 | 7 | inex1 5284 | . . . . . . . 8 ⊢ (𝑥 ∩ 𝑦) ∈ V |
| 10 | 9 | elpw 4564 | . . . . . . 7 ⊢ ((𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (𝑥 ∩ 𝑦) ⊆ ∪ 𝐴) |
| 11 | 6, 8, 10 | 3imtr4i 295 | . . . . . 6 ⊢ (𝑥 ∈ 𝒫 ∪ 𝐴 → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
| 12 | 11 | adantr 486 | . . . . 5 ⊢ ((𝑥 ∈ 𝒫 ∪ 𝐴 ∧ 𝑦 ∈ 𝒫 ∪ 𝐴) → (𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴) |
| 13 | 12 | rgen2 3204 | . . . 4 ⊢ ∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 |
| 14 | inficl 9399 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) | |
| 15 | 2, 14 | syl 18 | . . . 4 ⊢ (𝐴 ∈ V → (∀𝑥 ∈ 𝒫 ∪ 𝐴∀𝑦 ∈ 𝒫 ∪ 𝐴(𝑥 ∩ 𝑦) ∈ 𝒫 ∪ 𝐴 ↔ (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴)) |
| 16 | 13, 15 | mpbii 236 | . . 3 ⊢ (𝐴 ∈ V → (fi‘𝒫 ∪ 𝐴) = 𝒫 ∪ 𝐴) |
| 17 | 5, 16 | sseqtrd 3970 | . 2 ⊢ (𝐴 ∈ V → (fi‘𝐴) ⊆ 𝒫 ∪ 𝐴) |
| 18 | fvprc 6874 | . . 3 ⊢ (¬ 𝐴 ∈ V → (fi‘𝐴) = ∅) | |
| 19 | 0ss 4353 | . . 3 ⊢ ∅ ⊆ 𝒫 ∪ 𝐴 | |
| 20 | 18, 19 | eqsstrdi 3978 | . 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 3078 Vcvv 3453 ∩ cin 3901 ⊆ wss 3902 ∅c0 4282 𝒫 cpw 4560 ∪ cuni 4870 ‘cfv 6537 ficfi 9384 |
| 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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-int 4911 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-om 7867 df-1o 8459 df-2o 8460 df-en 8957 df-fin 8960 df-fi 9385 |
| This theorem is used by: fiuni 9402 ordtbas 23423 |
| Copyright terms: Public domain | W3C validator |