| 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 23794 | . 2 ⊢ (𝐵 ∈ 𝐴 → (𝐹 ∈ (fBas‘𝐵) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)))) | |
| 2 | elin 3905 | . . . . . . . 8 ⊢ (𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦))) | |
| 3 | velpw 4546 | . . . . . . . . 9 ⊢ (𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦) ↔ 𝑧 ⊆ (𝑥 ∩ 𝑦)) | |
| 4 | 3 | anbi2i 624 | . . . . . . . 8 ⊢ ((𝑧 ∈ 𝐹 ∧ 𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 5 | 2, 4 | bitri 275 | . . . . . . 7 ⊢ (𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 6 | 5 | exbii 1850 | . . . . . 6 ⊢ (∃𝑧 𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∃𝑧(𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 7 | n0 4293 | . . . . . 6 ⊢ ((𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦))) | |
| 8 | df-rex 3062 | . . . . . 6 ⊢ (∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦) ↔ ∃𝑧(𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) | |
| 9 | 6, 7, 8 | 3bitr4i 303 | . . . . 5 ⊢ ((𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)) |
| 10 | 9 | 2ralbii 3112 | . . . 4 ⊢ (∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)) |
| 11 | 10 | 3anbi3i 1160 | . . 3 ⊢ ((𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅) ↔ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 12 | 11 | anbi2i 624 | . 2 ⊢ ((𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))) |
| 13 | 1, 12 | bitrdi 287 | 1 ⊢ (𝐵 ∈ 𝐴 → (𝐹 ∈ (fBas‘𝐵) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 ∃wex 1781 ∈ wcel 2114 ≠ wne 2932 ∉ wnel 3036 ∀wral 3051 ∃wrex 3061 ∩ cin 3888 ⊆ wss 3889 ∅c0 4273 𝒫 cpw 4541 ‘cfv 6498 fBascfbas 21340 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fv 6506 df-fbas 21349 |
| This theorem is referenced by: fbasssin 23801 fbun 23805 opnfbas 23807 isfil2 23821 fsubbas 23832 fbasrn 23849 rnelfmlem 23917 metustfbas 24522 tailfb 36559 |
| Copyright terms: Public domain | W3C validator |