MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fmid Structured version   Visualization version   GIF version

Theorem fmid 24312
Description: The filter map applied to the identity. (Contributed by Jeff Hankins, 8-Nov-2009.) (Revised by Mario Carneiro, 27-Aug-2015.)
Assertion
Ref Expression
fmid (𝐹 ∈ (Fil‘𝑋) → ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) = 𝐹)

Proof of Theorem fmid
Dummy variables 𝑡 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 filfbas 24200 . . . 4 (𝐹 ∈ (Fil‘𝑋) → 𝐹 ∈ (fBas‘𝑋))
2 f1oi 6889 . . . . 5 ( I ↾ 𝑋):𝑋⟶1-1onto𝑋
3 f1ofo 6857 . . . . 5 (( I ↾ 𝑋):𝑋⟶1-1onto𝑋 → ( I ↾ 𝑋):𝑋⟶onto𝑋)
42, 3ax-mp 5 . . . 4 ( I ↾ 𝑋):𝑋⟶onto𝑋
5 eqid 2763 . . . . 5 (𝑋filGen𝐹) = (𝑋filGen𝐹)
65elfm3 24302 . . . 4 ((𝐹 ∈ (fBas‘𝑋) ∧ ( I ↾ 𝑋):𝑋⟶onto𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠)))
71, 4, 6sylancl 598 . . 3 (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ ∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠)))
8 fgfil 24227 . . . 4 (𝐹 ∈ (Fil‘𝑋) → (𝑋filGen𝐹) = 𝐹)
98rexeqdv 3324 . . 3 (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ (𝑋filGen𝐹)𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠)))
10 filelss 24204 . . . . . . . 8 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → 𝑠 ⊆ 𝑋)
11 resiima 6087 . . . . . . . 8 (𝑠 ⊆ 𝑋 → (( I ↾ 𝑋) “ 𝑠) = 𝑠)
1210, 11syl 18 . . . . . . 7 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (( I ↾ 𝑋) “ 𝑠) = 𝑠)
1312eqeq2d 2774 . . . . . 6 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 = 𝑠))
14 equcom 2053 . . . . . 6 (𝑠 = 𝑡 ↔ 𝑡 = 𝑠)
1513, 14bitr4di 292 . . . . 5 ((𝐹 ∈ (Fil‘𝑋) ∧ 𝑠 ∈ 𝐹) → (𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑠 = 𝑡))
1615rexbidva 3188 . . . 4 (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡))
17 risset 3241 . . . 4 (𝑡 ∈ 𝐹 ↔ ∃𝑠 ∈ 𝐹 𝑠 = 𝑡)
1816, 17bitr4di 292 . . 3 (𝐹 ∈ (Fil‘𝑋) → (∃𝑠 ∈ 𝐹 𝑡 = (( I ↾ 𝑋) “ 𝑠) ↔ 𝑡 ∈ 𝐹))
197, 9, 183bitrd 308 . 2 (𝐹 ∈ (Fil‘𝑋) → (𝑡 ∈ ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) ↔ 𝑡 ∈ 𝐹))
2019eqrdv 2761 1 (𝐹 ∈ (Fil‘𝑋) → ((𝑋 FilMap ( I ↾ 𝑋))‘𝐹) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900   I cid 5550   ↾ cres 5658   “ cima 5659  ⟶ontowfo 6559  ⟶1-1ontowf1o 6560  ‘cfv 6561  (class class class)co 7446  fBascfbas 21699  filGencfg 21700  Filcfil 24197   FilMap cfm 24285
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-fbas 21708  df-fg 21709  df-fil 24198  df-fm 24290
This theorem is used by:  ufldom  24314
  Copyright terms: Public domain W3C validator