| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isfbas2 | Structured version Visualization version GIF version | ||
| Description: The predicate "𝐹 is a filter base." (Contributed by Jeff Hankins, 1-Sep-2009.) (Revised by Stefan O'Rear, 28-Jul-2015.) |
| Ref | Expression |
|---|---|
| isfbas2 | ⊢ (𝐵 ∈ 𝐴 → (𝐹 ∈ (fBas‘𝐵) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | isfbas 23723 | . 2 ⊢ (𝐵 ∈ 𝐴 → (𝐹 ∈ (fBas‘𝐵) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)))) | |
| 2 | elin 3933 | . . . . . . . 8 ⊢ (𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦))) | |
| 3 | velpw 4571 | . . . . . . . . 9 ⊢ (𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦) ↔ 𝑧 ⊆ (𝑥 ∩ 𝑦)) | |
| 4 | 3 | anbi2i 623 | . . . . . . . 8 ⊢ ((𝑧 ∈ 𝐹 ∧ 𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 5 | 2, 4 | bitri 275 | . . . . . . 7 ⊢ (𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 6 | 5 | exbii 1848 | . . . . . 6 ⊢ (∃𝑧 𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∃𝑧(𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 7 | n0 4319 | . . . . . 6 ⊢ ((𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦))) | |
| 8 | df-rex 3055 | . . . . . 6 ⊢ (∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦) ↔ ∃𝑧(𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) | |
| 9 | 6, 7, 8 | 3bitr4i 303 | . . . . 5 ⊢ ((𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)) |
| 10 | 9 | 2ralbii 3109 | . . . 4 ⊢ (∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)) |
| 11 | 10 | 3anbi3i 1159 | . . 3 ⊢ ((𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) ↔ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 12 | 11 | anbi2i 623 | . 2 ⊢ ((𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))) |
| 13 | 1, 12 | bitrdi 287 | 1 ⊢ (𝐵 ∈ 𝐴 → (𝐹 ∈ (fBas‘𝐵) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 ∃wex 1779 ∈ wcel 2109 ≠ wne 2926 ∉ wnel 3030 ∀wral 3045 ∃wrex 3054 ∩ cin 3916 ⊆ wss 3917 ∅c0 4299 𝒫 cpw 4566 ‘cfv 6514 fBascfbas 21259 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fv 6522 df-fbas 21268 |
| This theorem is referenced by: fbasssin 23730 fbun 23734 opnfbas 23736 isfil2 23750 fsubbas 23761 fbasrn 23778 rnelfmlem 23846 metustfbas 24452 tailfb 36372 |
| Copyright terms: Public domain | W3C validator |