| 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 23813 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋)) | |
| 2 | f1oi 6818 | . . . . 5 ⊢ ( I ↾ 𝑋):𝑋–1-1-onto→𝑋 | |
| 3 | f1ofo 6787 | . . . . 5 ⊢ (( I ↾ 𝑋):𝑋–1-1-onto→𝑋 → ( I ↾ 𝑋):𝑋–onto→𝑋) | |
| 4 | 2, 3 | ax-mp 5 | . . . 4 ⊢ ( I ↾ 𝑋):𝑋–onto→𝑋 |
| 5 | eqid 2736 | . . . . 5 ⊢ (𝑋filGen𝐹) = (𝑋filGen𝐹) | |
| 6 | 5 | elfm3 23915 | . . . 4 ⊢ ((𝐹 ∈ (fBas‘𝑋) ∧ ( I ↾ 𝑋):𝑋–onto→𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 7 | 1, 4, 6 | sylancl 587 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 8 | fgfil 23840 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑋filGen𝐹) = 𝐹) | |
| 9 | 8 | rexeqdv 3296 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠))) |
| 10 | filelss 23817 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋) | |
| 11 | resiima 6041 | . . . . . . . 8 ⊢ (𝑠 ⊆ 𝑋 → (( I ↾ 𝑋) “ 𝑠) = 𝑠) | |
| 12 | 10, 11 | syl 17 | . . . . . . 7 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (( I ↾ 𝑋) “ 𝑠) = 𝑠) |
| 13 | 12 | eqeq2d 2747 | . . . . . 6 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 = 𝑠)) |
| 14 | equcom 2020 | . . . . . 6 ⊢ (𝑠 = 𝑡 ↔ 𝑡 = 𝑠) | |
| 15 | 13, 14 | bitr4di 289 | . . . . 5 ⊢ ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑠 = 𝑡)) |
| 16 | 15 | rexbidva 3159 | . . . 4 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡)) |
| 17 | risset 3212 | . . . 4 ⊢ (𝑡 ∈ 𝐹 ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡) | |
| 18 | 16, 17 | bitr4di 289 | . . 3 ⊢ (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 ∈ 𝐹)) |
| 19 | 7, 9, 18 | 3bitrd 305 | . 2 ⊢ (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ 𝑡 ∈ 𝐹)) |
| 20 | 19 | eqrdv 2734 | 1 ⊢ (𝐹 ∈ (Fil‘𝑋) → ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) = 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 ⊆ wss 3889 I cid 5525 ↾ cres 5633 “ cima 5634 –onto→wfo 6496 –1-1-onto→wf1o 6497 ‘cfv 6498 (class class class)co 7367 fBascfbas 21340 filGencfg 21341 Filcfil 23810 FilMap cfm 23898 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-ov 7370 df-oprab 7371 df-mpo 7372 df-fbas 21349 df-fg 21350 df-fil 23811 df-fm 23903 |
| This theorem is referenced by: ufldom 23927 |
| Copyright terms: Public domain | W3C validator |