![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > trfil1 | Structured version Visualization version GIF version |
Description: Conditions for the trace of a filter 𝐿 to be a filter. (Contributed by FL, 2-Sep-2013.) (Revised by Stefan O'Rear, 2-Aug-2015.) |
Ref | Expression |
---|---|
trfil1 | ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 = ∪ (𝐿 ↾t 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 477 | . . . . 5 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 ⊆ 𝑌) | |
2 | sseqin2 4081 | . . . . 5 ⊢ (𝐴 ⊆ 𝑌 ↔ (𝑌 ∩ 𝐴) = 𝐴) | |
3 | 1, 2 | sylib 210 | . . . 4 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → (𝑌 ∩ 𝐴) = 𝐴) |
4 | simpl 475 | . . . . 5 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐿 ∈ (Fil‘𝑌)) | |
5 | id 22 | . . . . . 6 ⊢ (𝐴 ⊆ 𝑌 → 𝐴 ⊆ 𝑌) | |
6 | filtop 22170 | . . . . . 6 ⊢ (𝐿 ∈ (Fil‘𝑌) → 𝑌 ∈ 𝐿) | |
7 | ssexg 5084 | . . . . . 6 ⊢ ((𝐴 ⊆ 𝑌 ∧ 𝑌 ∈ 𝐿) → 𝐴 ∈ V) | |
8 | 5, 6, 7 | syl2anr 587 | . . . . 5 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 ∈ V) |
9 | 6 | adantr 473 | . . . . 5 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝑌 ∈ 𝐿) |
10 | elrestr 16561 | . . . . 5 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ∈ V ∧ 𝑌 ∈ 𝐿) → (𝑌 ∩ 𝐴) ∈ (𝐿 ↾t 𝐴)) | |
11 | 4, 8, 9, 10 | syl3anc 1351 | . . . 4 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → (𝑌 ∩ 𝐴) ∈ (𝐿 ↾t 𝐴)) |
12 | 3, 11 | eqeltrrd 2867 | . . 3 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 ∈ (𝐿 ↾t 𝐴)) |
13 | elssuni 4742 | . . 3 ⊢ (𝐴 ∈ (𝐿 ↾t 𝐴) → 𝐴 ⊆ ∪ (𝐿 ↾t 𝐴)) | |
14 | 12, 13 | syl 17 | . 2 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 ⊆ ∪ (𝐿 ↾t 𝐴)) |
15 | restsspw 16564 | . . . 4 ⊢ (𝐿 ↾t 𝐴) ⊆ 𝒫 𝐴 | |
16 | sspwuni 4889 | . . . 4 ⊢ ((𝐿 ↾t 𝐴) ⊆ 𝒫 𝐴 ↔ ∪ (𝐿 ↾t 𝐴) ⊆ 𝐴) | |
17 | 15, 16 | mpbi 222 | . . 3 ⊢ ∪ (𝐿 ↾t 𝐴) ⊆ 𝐴 |
18 | 17 | a1i 11 | . 2 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → ∪ (𝐿 ↾t 𝐴) ⊆ 𝐴) |
19 | 14, 18 | eqssd 3877 | 1 ⊢ ((𝐿 ∈ (Fil‘𝑌) ∧ 𝐴 ⊆ 𝑌) → 𝐴 = ∪ (𝐿 ↾t 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 387 = wceq 1507 ∈ wcel 2050 Vcvv 3415 ∩ cin 3830 ⊆ wss 3831 𝒫 cpw 4423 ∪ cuni 4713 ‘cfv 6190 (class class class)co 6978 ↾t crest 16553 Filcfil 22160 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-13 2301 ax-ext 2750 ax-rep 5050 ax-sep 5061 ax-nul 5068 ax-pow 5120 ax-pr 5187 ax-un 7281 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-mo 2547 df-eu 2583 df-clab 2759 df-cleq 2771 df-clel 2846 df-nfc 2918 df-ne 2968 df-nel 3074 df-ral 3093 df-rex 3094 df-reu 3095 df-rab 3097 df-v 3417 df-sbc 3684 df-csb 3789 df-dif 3834 df-un 3836 df-in 3838 df-ss 3845 df-nul 4181 df-if 4352 df-pw 4425 df-sn 4443 df-pr 4445 df-op 4449 df-uni 4714 df-iun 4795 df-br 4931 df-opab 4993 df-mpt 5010 df-id 5313 df-xp 5414 df-rel 5415 df-cnv 5416 df-co 5417 df-dm 5418 df-rn 5419 df-res 5420 df-ima 5421 df-iota 6154 df-fun 6192 df-fn 6193 df-f 6194 df-f1 6195 df-fo 6196 df-f1o 6197 df-fv 6198 df-ov 6981 df-oprab 6982 df-mpo 6983 df-1st 7503 df-2nd 7504 df-rest 16555 df-fbas 20247 df-fil 22161 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |