| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fmid | Structured version Visualization version GIF version | ||
| Description: The filter map applied to the identity. (Contributed by Jeff Hankins, 8-Nov-2009.) (Revised by Mario Carneiro, 27-Aug-2015.) |
| Ref | Expression |
|---|---|
| fmid | ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) = 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | filfbas 23741 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | f1oi 6840 | . . . . 5 ⊢ ( I ↾ 𝑋):𝑋–1-1-onto→𝑋 | |
| 3 | f1ofo 6809 | . . . . 5 ⊢ (( I ↾ 𝑋):𝑋–1-1-onto→𝑋 → ( I ↾ 𝑋):𝑋–onto→𝑋) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ ( I ↾ 𝑋):𝑋–onto→𝑋 |
| 5 | eqid 2730 | . . . . 5 ⊢ (𝑋filGen𝐹) = (𝑋filGen𝐹) | |
| 6 | 5 | elfm3 23843 | . . . 4 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ ( I ↾ 𝑋):𝑋–onto→𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 7 | 1, 4, 6 | sylancl 586 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 8 | fgfil 23768 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑋filGen𝐹) = 𝐹) | |
| 9 | 8 | rexeqdv 3302 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 10 | filelss 23745 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋) | |
| 11 | resiima 6049 | . . . . . . . 8 ⊢ (𝑠 ⊆ 𝑋 → (( I ↾ 𝑋) “ 𝑠) = 𝑠) | |
| 12 | 10, 11 | syl 17 | . . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (( I ↾ 𝑋) “ 𝑠) = 𝑠) |
| 13 | 12 | eqeq2d 2741 | . . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 = 𝑠)) |
| 14 | equcom 2018 | . . . . . 6 ⊢ (𝑠 = 𝑡 ↔ 𝑡 = 𝑠) | |
| 15 | 13, 14 | bitr4di 289 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑠 = 𝑡)) |
| 16 | 15 | rexbidva 3156 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡)) |
| 17 | risset 3213 | . . . 4 ⊢ (𝑡 ∈ 𝐹 ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡) | |
| 18 | 16, 17 | bitr4di 289 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 ∈ 𝐹)) |
| 19 | 7, 9, 18 | 3bitrd 305 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ 𝑡 ∈ 𝐹)) |
| 20 | 19 | eqrdv 2728 | 1 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃wrex 3054 ⊆ wss 3916 I cid 5534 ↾ cres 5642 “ cima 5643 –onto→wfo 6511 –1-1-onto→wf1o 6512 ‘cfv 6513 (class class class)co 7389 fBascfbas 21258 filGencfg 21259 Filcfil 23738 FilMap cfm 23826 |
| 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-rep 5236 ax-sep 5253 ax-nul 5263 ax-pow 5322 ax-pr 5389 |
| 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-reu 3357 df-rab 3409 df-v 3452 df-sbc 3756 df-csb 3865 df-dif 3919 df-un 3921 df-in 3923 df-ss 3933 df-nul 4299 df-if 4491 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-iun 4959 df-br 5110 df-opab 5172 df-mpt 5191 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6515 df-fn 6516 df-f 6517 df-f1 6518 df-fo 6519 df-f1o 6520 df-fv 6521 df-ov 7392 df-oprab 7393 df-mpo 7394 df-fbas 21267 df-fg 21268 df-fil 23739 df-fm 23831 |
| This theorem is referenced by: ufldom 23855 |
| Copyright terms: Public domain | W3C validator |