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

Theorem fmfnfmlem3 24275
Description: Lemma for fmfnfm 24277. (Contributed by Jeff Hankins, 19-Nov-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)
Hypotheses
Ref Expression
fmfnfm.b (𝜑 → 𝐵 ∈ (fBas‘𝑌))
fmfnfm.l (𝜑 → 𝐿 ∈ (Fil‘𝑋))
fmfnfm.f (𝜑 → 𝐹:𝑌⟶𝑋)
fmfnfm.fm (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿)
Assertion
Ref Expression
fmfnfmlem3 (𝜑 → (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐹   𝑥,𝐿   𝜑,𝑥   𝑥,𝑋   𝑥,𝑌

Proof of Theorem fmfnfmlem3
Dummy variables 𝑠 𝑡 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fmfnfm.l . . . . . . . 8 (𝜑 → 𝐿 ∈ (Fil‘𝑋))
2 filin 24173 . . . . . . . . 9 ((𝐿 ∈ (Fil‘𝑋) ∧ 𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿) → (𝑦 ∩ 𝑧) ∈ 𝐿)
323expb 1138 . . . . . . . 8 ((𝐿 ∈ (Fil‘𝑋) ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → (𝑦 ∩ 𝑧) ∈ 𝐿)
41, 3sylan 592 . . . . . . 7 ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → (𝑦 ∩ 𝑧) ∈ 𝐿)
5 fmfnfm.f . . . . . . . . 9 (𝜑 → 𝐹:𝑌⟶𝑋)
6 ffun 6712 . . . . . . . . 9 (𝐹:𝑌⟶𝑋 → Fun 𝐹)
7 funcnvcnv 6607 . . . . . . . . 9 (Fun 𝐹 → Fun ◡◡𝐹)
8 imain 6625 . . . . . . . . . 10 (Fun ◡◡𝐹 → (◡𝐹 “ (𝑦 ∩ 𝑧)) = ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)))
98eqcomd 2766 . . . . . . . . 9 (Fun ◡◡𝐹 → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
105, 6, 7, 94syl 20 . . . . . . . 8 (𝜑 → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
1110adantr 486 . . . . . . 7 ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
12 imaeq2 6047 . . . . . . . 8 (𝑥 = (𝑦 ∩ 𝑧) → (◡𝐹 “ 𝑥) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
1312rspceeqv 3598 . . . . . . 7 (((𝑦 ∩ 𝑧) ∈ 𝐿 ∧ ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧))) → ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥))
144, 11, 13syl2anc 596 . . . . . 6 ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥))
15 ineq12 4112 . . . . . . . 8 ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → (𝑠 ∩ 𝑡) = ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)))
1615eqeq1d 2762 . . . . . . 7 ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ((𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥) ↔ ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥)))
1716rexbidv 3186 . . . . . 6 ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → (∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥)))
1814, 17syl5ibrcom 250 . . . . 5 ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
1918rexlimdvva 3219 . . . 4 (𝜑 → (∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
20 imaeq2 6047 . . . . . . . 8 (𝑥 = 𝑦 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑦))
2120eqeq2d 2771 . . . . . . 7 (𝑥 = 𝑦 → (𝑠 = (◡𝐹 “ 𝑥) ↔ 𝑠 = (◡𝐹 “ 𝑦)))
2221cbvrexvw 3241 . . . . . 6 (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ↔ ∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦))
23 imaeq2 6047 . . . . . . . 8 (𝑥 = 𝑧 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑧))
2423eqeq2d 2771 . . . . . . 7 (𝑥 = 𝑧 → (𝑡 = (◡𝐹 “ 𝑥) ↔ 𝑡 = (◡𝐹 “ 𝑧)))
2524cbvrexvw 3241 . . . . . 6 (∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥) ↔ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧))
2622, 25anbi12i 640 . . . . 5 ((∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ∧ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)) ↔ (∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦) ∧ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧)))
27 eqid 2760 . . . . . . . 8 (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) = (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))
2827elrnmpt 5939 . . . . . . 7 (𝑠 ∈ V → (𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥)))
2928elv 3455 . . . . . 6 (𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥))
3027elrnmpt 5939 . . . . . . 7 (𝑡 ∈ V → (𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)))
3130elv 3455 . . . . . 6 (𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥))
3229, 31anbi12i 640 . . . . 5 ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) ↔ (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ∧ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)))
33 reeanv 3234 . . . . 5 (∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) ↔ (∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦) ∧ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧)))
3426, 32, 333bitr4i 306 . . . 4 ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) ↔ ∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)))
35 vex 3454 . . . . . 6 𝑠 ∈ V
3635inex1 5276 . . . . 5 (𝑠 ∩ 𝑡) ∈ V
3727elrnmpt 5939 . . . . 5 ((𝑠 ∩ 𝑡) ∈ V → ((𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
3836, 37ax-mp 5 . . . 4 ((𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥))
3919, 34, 383imtr4g 299 . . 3 (𝜑 → ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) → (𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
4039ralrimivv 3203 . 2 (𝜑 → ∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)))
41 mptexg 7227 . . 3 (𝐿 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V)
42 rnexg 7914 . . 3 ((𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V → ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V)
43 inficl 9417 . . 3 (ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V → (∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
441, 41, 42, 434syl 20 . 2 (𝜑 → (∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
4540, 44mpbid 235 1 (𝜑 → (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895   ∩ cin 4089   ↦ cmpt 5185  ◡ccnv 5649  ran crn 5651   “ cima 5653  Fun wfun 6532  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420  ficfi 9402  fBascfbas 21666  Filcfil 24164   FilMap cfm 24252
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-om 7878  df-1o 8476  df-2o 8477  df-en 8974  df-fin 8977  df-fi 9403  df-fbas 21675  df-fil 24165
This theorem is used by:  fmfnfmlem4  24276
  Copyright terms: Public domain W3C validator