| 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 23751 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | f1oi 6806 | . . . . 5 ⊢ ( I ↾ 𝑋):𝑋–1-1-onto→𝑋 | |
| 3 | f1ofo 6775 | . . . . 5 ⊢ (( I ↾ 𝑋):𝑋–1-1-onto→𝑋 → ( I ↾ 𝑋):𝑋–onto→𝑋) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ ( I ↾ 𝑋):𝑋–onto→𝑋 |
| 5 | eqid 2729 | . . . . 5 ⊢ (𝑋filGen𝐹) = (𝑋filGen𝐹) | |
| 6 | 5 | elfm3 23853 | . . . 4 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ ( I ↾ 𝑋):𝑋–onto→𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 7 | 1, 4, 6 | sylancl 586 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 8 | fgfil 23778 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑋filGen𝐹) = 𝐹) | |
| 9 | 8 | rexeqdv 3291 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 10 | filelss 23755 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋) | |
| 11 | resiima 6031 | . . . . . . . 8 ⊢ (𝑠 ⊆ 𝑋 → (( I ↾ 𝑋) “ 𝑠) = 𝑠) | |
| 12 | 10, 11 | syl 17 | . . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (( I ↾ 𝑋) “ 𝑠) = 𝑠) |
| 13 | 12 | eqeq2d 2740 | . . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 = 𝑠)) |
| 14 | equcom 2018 | . . . . . 6 ⊢ (𝑠 = 𝑡 ↔ 𝑡 = 𝑠) | |
| 15 | 13, 14 | bitr4di 289 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑠 = 𝑡)) |
| 16 | 15 | rexbidva 3151 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡)) |
| 17 | risset 3204 | . . . 4 ⊢ (𝑡 ∈ 𝐹 ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡) | |
| 18 | 16, 17 | bitr4di 289 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 ∈ 𝐹)) |
| 19 | 7, 9, 18 | 3bitrd 305 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ 𝑡 ∈ 𝐹)) |
| 20 | 19 | eqrdv 2727 | 1 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 ⊆ wss 3905 I cid 5517 ↾ cres 5625 “ cima 5626 –onto→wfo 6484 –1-1-onto→wf1o 6485 ‘cfv 6486 (class class class)co 7353 fBascfbas 21267 filGencfg 21268 Filcfil 23748 FilMap cfm 23836 |
| 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 2701 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-reu 3346 df-rab 3397 df-v 3440 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4862 df-iun 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5518 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-ov 7356 df-oprab 7357 df-mpo 7358 df-fbas 21276 df-fg 21277 df-fil 23749 df-fm 23841 |
| This theorem is referenced by: ufldom 23865 |
| Copyright terms: Public domain | W3C validator |