| 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 23773 | . 2 ⊢ (𝐵 ∈ 𝐴 → (𝐹 ∈ (fBas‘𝐵) ↔ (𝐹 ⊆ 𝒫 𝐵 ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅)))) | |
| 2 | elin 3917 | . . . . . . . 8 ⊢ (𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦))) | |
| 3 | velpw 4559 | . . . . . . . . 9 ⊢ (𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦) ↔ 𝑧 ⊆ (𝑥 ∩ 𝑦)) | |
| 4 | 3 | anbi2i 623 | . . . . . . . 8 ⊢ ((𝑧 ∈ 𝐹 ∧ 𝑧 ∈ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 5 | 2, 4 | bitri 275 | . . . . . . 7 ⊢ (𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ (𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 6 | 5 | exbii 1849 | . . . . . 6 ⊢ (∃𝑧 𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ↔ ∃𝑧(𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) |
| 7 | n0 4305 | . . . . . 6 ⊢ ((𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∃𝑧 𝑧 ∈ (𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦))) | |
| 8 | df-rex 3061 | . . . . . 6 ⊢ (∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦) ↔ ∃𝑧(𝑧 ∈ 𝐹 ∧ 𝑧 ⊆ (𝑥 ∩ 𝑦))) | |
| 9 | 6, 7, 8 | 3bitr4i 303 | . . . . 5 ⊢ ((𝐹 ∩ 𝒫 (𝑥 ∩ 𝑦)) ≠ ∅ ↔ ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)) |
| 10 | 9 | 2ralbii 3111 | . . . 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 1780 ∈ wcel 2113 ≠ wne 2932 ∉ wnel 3036 ∀wral 3051 ∃wrex 3060 ∩ cin 3900 ⊆ wss 3901 ∅c0 4285 𝒫 cpw 4554 ‘cfv 6492 fBascfbas 21297 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 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 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fv 6500 df-fbas 21306 |
| This theorem is referenced by: fbasssin 23780 fbun 23784 opnfbas 23786 isfil2 23800 fsubbas 23811 fbasrn 23828 rnelfmlem 23896 metustfbas 24501 tailfb 36571 |
| Copyright terms: Public domain | W3C validator |