| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > trfbas | Structured version Visualization version GIF version | ||
| Description: Conditions for the trace of a filter base 𝐹 to be a filter base. (Contributed by Mario Carneiro, 13-Oct-2015.) |
| Ref | Expression |
|---|---|
| trfbas | ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → ((𝐹 ↾t 𝐴) ∈ (fBas‘𝐴) ↔ ∀𝑣 ∈ 𝐹 (𝑣 ∩ 𝐴) ≠ ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | trfbas2 24037 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → ((𝐹 ↾t 𝐴) ∈ (fBas‘𝐴) ↔ ¬ ∅ ∈ (𝐹 ↾t 𝐴))) | |
| 2 | elfvdm 6922 | . . . . . 6 ⊢ (𝐹 ∈ (fBas‘𝑌) → 𝑌 ∈ dom fBas) | |
| 3 | ssexg 5295 | . . . . . . 7 ⊢ ((𝐴 ⊆ 𝑌 ∧ 𝑌 ∈ dom fBas) → 𝐴 ∈ V) | |
| 4 | 3 | ancoms 464 | . . . . . 6 ⊢ ((𝑌 ∈ dom fBas ∧ 𝐴 ⊆ 𝑌) → 𝐴 ∈ V) |
| 5 | 2, 4 | sylan 592 | . . . . 5 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 ∈ V) |
| 6 | elrest 17505 | . . . . 5 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ∈ V) → (∅ ∈ (𝐹 ↾t 𝐴) ↔ ∃𝑣 ∈ 𝐹 ∅ = (𝑣 ∩ 𝐴))) | |
| 7 | 5, 6 | syldan 603 | . . . 4 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → (∅ ∈ (𝐹 ↾t 𝐴) ↔ ∃𝑣 ∈ 𝐹 ∅ = (𝑣 ∩ 𝐴))) |
| 8 | 7 | notbid 321 | . . 3 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → (¬ ∅ ∈ (𝐹 ↾t 𝐴) ↔ ¬ ∃𝑣 ∈ 𝐹 ∅ = (𝑣 ∩ 𝐴))) |
| 9 | nesym 3017 | . . . . 5 ⊢ ((𝑣 ∩ 𝐴) ≠ ∅ ↔ ¬ ∅ = (𝑣 ∩ 𝐴)) | |
| 10 | 9 | ralbii 3114 | . . . 4 ⊢ (∀𝑣 ∈ 𝐹 (𝑣 ∩ 𝐴) ≠ ∅ ↔ ∀𝑣 ∈ 𝐹 ¬ ∅ = (𝑣 ∩ 𝐴)) |
| 11 | ralnex 3094 | . . . 4 ⊢ (∀𝑣 ∈ 𝐹 ¬ ∅ = (𝑣 ∩ 𝐴) ↔ ¬ ∃𝑣 ∈ 𝐹 ∅ = (𝑣 ∩ 𝐴)) | |
| 12 | 10, 11 | bitri 278 | . . 3 ⊢ (∀𝑣 ∈ 𝐹 (𝑣 ∩ 𝐴) ≠ ∅ ↔ ¬ ∃𝑣 ∈ 𝐹 ∅ = (𝑣 ∩ 𝐴)) |
| 13 | 8, 12 | bitr4di 292 | . 2 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → (¬ ∅ ∈ (𝐹 ↾t 𝐴) ↔ ∀𝑣 ∈ 𝐹 (𝑣 ∩ 𝐴) ≠ ∅)) |
| 14 | 1, 13 | bitrd 282 | 1 ⊢ ((𝐹 ∈ (fBas‘𝑌) ∧ 𝐴 ⊆ 𝑌) → ((𝐹 ↾t 𝐴) ∈ (fBas‘𝐴) ↔ ∀𝑣 ∈ 𝐹 (𝑣 ∩ 𝐴) ≠ ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ≠ wne 2961 ∀wral 3082 ∃wrex 3092 Vcvv 3458 ∩ cin 3907 ⊆ wss 3908 ∅c0 4289 dom cdm 5666 ‘cfv 6543 (class class class)co 7423 ↾t crest 17498 fBascfbas 21547 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5243 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-id 5561 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-oprab 7427 df-mpo 7428 df-1st 7995 df-2nd 7996 df-rest 17500 df-fbas 21556 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |