![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fbasfip | Structured version Visualization version GIF version |
Description: A filter base has the finite intersection property. (Contributed by Jeff Hankins, 2-Sep-2009.) (Revised by Stefan O'Rear, 2-Aug-2015.) |
Ref | Expression |
---|---|
fbasfip | ⊢ (𝐹 ∈ (fBas‘𝑋) → ¬ ∅ ∈ (fi‘𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 3979 | . . . . . 6 ⊢ (𝑦 ∈ (𝒫 𝐹 ∩ Fin) ↔ (𝑦 ∈ 𝒫 𝐹 ∧ 𝑦 ∈ Fin)) | |
2 | elpwi 4612 | . . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝐹 → 𝑦 ⊆ 𝐹) | |
3 | 2 | anim1i 615 | . . . . . 6 ⊢ ((𝑦 ∈ 𝒫 𝐹 ∧ 𝑦 ∈ Fin) → (𝑦 ⊆ 𝐹 ∧ 𝑦 ∈ Fin)) |
4 | 1, 3 | sylbi 217 | . . . . 5 ⊢ (𝑦 ∈ (𝒫 𝐹 ∩ Fin) → (𝑦 ⊆ 𝐹 ∧ 𝑦 ∈ Fin)) |
5 | fbssint 23862 | . . . . . 6 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ⊆ 𝐹 ∧ 𝑦 ∈ Fin) → ∃𝑧 ∈ 𝐹 𝑧 ⊆ ∩ 𝑦) | |
6 | 5 | 3expb 1119 | . . . . 5 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ (𝑦 ⊆ 𝐹 ∧ 𝑦 ∈ Fin)) → ∃𝑧 ∈ 𝐹 𝑧 ⊆ ∩ 𝑦) |
7 | 4, 6 | sylan2 593 | . . . 4 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) → ∃𝑧 ∈ 𝐹 𝑧 ⊆ ∩ 𝑦) |
8 | 0nelfb 23855 | . . . . . . . . 9 ⊢ (𝐹 ∈ (fBas‘𝑋) → ¬ ∅ ∈ 𝐹) | |
9 | 8 | ad2antrr 726 | . . . . . . . 8 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ 𝑧 ∈ 𝐹) → ¬ ∅ ∈ 𝐹) |
10 | eleq1 2827 | . . . . . . . . . 10 ⊢ (𝑧 = ∅ → (𝑧 ∈ 𝐹 ↔ ∅ ∈ 𝐹)) | |
11 | 10 | biimpcd 249 | . . . . . . . . 9 ⊢ (𝑧 ∈ 𝐹 → (𝑧 = ∅ → ∅ ∈ 𝐹)) |
12 | 11 | adantl 481 | . . . . . . . 8 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ 𝑧 ∈ 𝐹) → (𝑧 = ∅ → ∅ ∈ 𝐹)) |
13 | 9, 12 | mtod 198 | . . . . . . 7 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ 𝑧 ∈ 𝐹) → ¬ 𝑧 = ∅) |
14 | ss0 4408 | . . . . . . 7 ⊢ (𝑧 ⊆ ∅ → 𝑧 = ∅) | |
15 | 13, 14 | nsyl 140 | . . . . . 6 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ 𝑧 ∈ 𝐹) → ¬ 𝑧 ⊆ ∅) |
16 | 15 | adantrr 717 | . . . . 5 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ ∩ 𝑦)) → ¬ 𝑧 ⊆ ∅) |
17 | sseq2 4022 | . . . . . . 7 ⊢ (∅ = ∩ 𝑦 → (𝑧 ⊆ ∅ ↔ 𝑧 ⊆ ∩ 𝑦)) | |
18 | 17 | biimprcd 250 | . . . . . 6 ⊢ (𝑧 ⊆ ∩ 𝑦 → (∅ = ∩ 𝑦 → 𝑧 ⊆ ∅)) |
19 | 18 | ad2antll 729 | . . . . 5 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ ∩ 𝑦)) → (∅ = ∩ 𝑦 → 𝑧 ⊆ ∅)) |
20 | 16, 19 | mtod 198 | . . . 4 ⊢ (((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) ∧ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ ∩ 𝑦)) → ¬ ∅ = ∩ 𝑦) |
21 | 7, 20 | rexlimddv 3159 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ 𝑦 ∈ (𝒫 𝐹 ∩ Fin)) → ¬ ∅ = ∩ 𝑦) |
22 | 21 | nrexdv 3147 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → ¬ ∃𝑦 ∈ (𝒫 𝐹 ∩ Fin)∅ = ∩ 𝑦) |
23 | 0ex 5313 | . . 3 ⊢ ∅ ∈ V | |
24 | elfi 9451 | . . 3 ⊢ ((∅ ∈ V ∧ 𝐹 ∈ (fBas‘𝑋)) → (∅ ∈ (fi‘𝐹) ↔ ∃𝑦 ∈ (𝒫 𝐹 ∩ Fin)∅ = ∩ 𝑦)) | |
25 | 23, 24 | mpan 690 | . 2 ⊢ (𝐹 ∈ (fBas‘𝑋) → (∅ ∈ (fi‘𝐹) ↔ ∃𝑦 ∈ (𝒫 𝐹 ∩ Fin)∅ = ∩ 𝑦)) |
26 | 22, 25 | mtbird 325 | 1 ⊢ (𝐹 ∈ (fBas‘𝑋) → ¬ ∅ ∈ (fi‘𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 ∃wrex 3068 Vcvv 3478 ∩ cin 3962 ⊆ wss 3963 ∅c0 4339 𝒫 cpw 4605 ∩ cint 4951 ‘cfv 6563 Fincfn 8984 ficfi 9448 fBascfbas 21370 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-om 7888 df-1o 8505 df-2o 8506 df-en 8985 df-fin 8988 df-fi 9449 df-fbas 21379 |
This theorem is referenced by: fbunfip 23893 |
Copyright terms: Public domain | W3C validator |