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

Theorem fmfnfmlem3 24169
Description: Lemma for fmfnfm 24171. (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 24067 . . . . . . . . 9 ((𝐿 ∈ (Fil‘𝑋) ∧ 𝑦𝐿𝑧𝐿) → (𝑦𝑧) ∈ 𝐿)
323expb 1138 . . . . . . . 8 ((𝐿 ∈ (Fil‘𝑋) ∧ (𝑦𝐿𝑧𝐿)) → (𝑦𝑧) ∈ 𝐿)
41, 3sylan 592 . . . . . . 7 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → (𝑦𝑧) ∈ 𝐿)
5 fmfnfm.f . . . . . . . . 9 (𝜑𝐹:𝑌𝑋)
6 ffun 6713 . . . . . . . . 9 (𝐹:𝑌𝑋 → Fun 𝐹)
7 funcnvcnv 6608 . . . . . . . . 9 (Fun 𝐹 → Fun 𝐹)
8 imain 6626 . . . . . . . . . 10 (Fun 𝐹 → (𝐹 “ (𝑦𝑧)) = ((𝐹𝑦) ∩ (𝐹𝑧)))
98eqcomd 2771 . . . . . . . . 9 (Fun 𝐹 → ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧)))
105, 6, 7, 94syl 20 . . . . . . . 8 (𝜑 → ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧)))
1110adantr 486 . . . . . . 7 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧)))
12 imaeq2 6060 . . . . . . . 8 (𝑥 = (𝑦𝑧) → (𝐹𝑥) = (𝐹 “ (𝑦𝑧)))
1312rspceeqv 3606 . . . . . . 7 (((𝑦𝑧) ∈ 𝐿 ∧ ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧))) → ∃𝑥𝐿 ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥))
144, 11, 13syl2anc 596 . . . . . 6 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → ∃𝑥𝐿 ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥))
15 ineq12 4168 . . . . . . . 8 ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → (𝑠𝑡) = ((𝐹𝑦) ∩ (𝐹𝑧)))
1615eqeq1d 2767 . . . . . . 7 ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → ((𝑠𝑡) = (𝐹𝑥) ↔ ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥)))
1716rexbidv 3191 . . . . . 6 ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → (∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥) ↔ ∃𝑥𝐿 ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥)))
1814, 17syl5ibrcom 250 . . . . 5 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥)))
1918rexlimdvva 3224 . . . 4 (𝜑 → (∃𝑦𝐿𝑧𝐿 (𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥)))
20 imaeq2 6060 . . . . . . . 8 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
2120eqeq2d 2776 . . . . . . 7 (𝑥 = 𝑦 → (𝑠 = (𝐹𝑥) ↔ 𝑠 = (𝐹𝑦)))
2221cbvrexvw 3246 . . . . . 6 (∃𝑥𝐿 𝑠 = (𝐹𝑥) ↔ ∃𝑦𝐿 𝑠 = (𝐹𝑦))
23 imaeq2 6060 . . . . . . . 8 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
2423eqeq2d 2776 . . . . . . 7 (𝑥 = 𝑧 → (𝑡 = (𝐹𝑥) ↔ 𝑡 = (𝐹𝑧)))
2524cbvrexvw 3246 . . . . . 6 (∃𝑥𝐿 𝑡 = (𝐹𝑥) ↔ ∃𝑧𝐿 𝑡 = (𝐹𝑧))
2622, 25anbi12i 640 . . . . 5 ((∃𝑥𝐿 𝑠 = (𝐹𝑥) ∧ ∃𝑥𝐿 𝑡 = (𝐹𝑥)) ↔ (∃𝑦𝐿 𝑠 = (𝐹𝑦) ∧ ∃𝑧𝐿 𝑡 = (𝐹𝑧)))
27 eqid 2765 . . . . . . . 8 (𝑥𝐿 ↦ (𝐹𝑥)) = (𝑥𝐿 ↦ (𝐹𝑥))
2827elrnmpt 5950 . . . . . . 7 (𝑠 ∈ V → (𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑠 = (𝐹𝑥)))
2928elv 3462 . . . . . 6 (𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑠 = (𝐹𝑥))
3027elrnmpt 5950 . . . . . . 7 (𝑡 ∈ V → (𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑡 = (𝐹𝑥)))
3130elv 3462 . . . . . 6 (𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑡 = (𝐹𝑥))
3229, 31anbi12i 640 . . . . 5 ((𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ∧ 𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))) ↔ (∃𝑥𝐿 𝑠 = (𝐹𝑥) ∧ ∃𝑥𝐿 𝑡 = (𝐹𝑥)))
33 reeanv 3239 . . . . 5 (∃𝑦𝐿𝑧𝐿 (𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) ↔ (∃𝑦𝐿 𝑠 = (𝐹𝑦) ∧ ∃𝑧𝐿 𝑡 = (𝐹𝑧)))
3426, 32, 333bitr4i 306 . . . 4 ((𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ∧ 𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))) ↔ ∃𝑦𝐿𝑧𝐿 (𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)))
35 vex 3461 . . . . . 6 𝑠 ∈ V
3635inex1 5288 . . . . 5 (𝑠𝑡) ∈ V
3727elrnmpt 5950 . . . . 5 ((𝑠𝑡) ∈ V → ((𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥)))
3836, 37ax-mp 5 . . . 4 ((𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥))
3919, 34, 383imtr4g 299 . . 3 (𝜑 → ((𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ∧ 𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))) → (𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))))
4039ralrimivv 3208 . 2 (𝜑 → ∀𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))∀𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))(𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)))
41 mptexg 7227 . . 3 (𝐿 ∈ (Fil‘𝑋) → (𝑥𝐿 ↦ (𝐹𝑥)) ∈ V)
42 rnexg 7906 . . 3 ((𝑥𝐿 ↦ (𝐹𝑥)) ∈ V → ran (𝑥𝐿 ↦ (𝐹𝑥)) ∈ V)
43 inficl 9393 . . 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 1570  wcel 2146  wral 3081  wrex 3091  Vcvv 3457  cin 3905  wss 3906  cmpt 5194  ccnv 5662  ran crn 5664  cima 5666  Fun wfun 6535  wf 6537  cfv 6541  (class class class)co 7420  ficfi 9378  fBascfbas 21565  Filcfil 24058   FilMap cfm 24146
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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7743
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6543  df-fn 6544  df-f 6545  df-f1 6546  df-fo 6547  df-f1o 6548  df-fv 6549  df-om 7870  df-1o 8460  df-2o 8461  df-en 8951  df-fin 8954  df-fi 9379  df-fbas 21574  df-fil 24059
This theorem is used by:  fmfnfmlem4  24170
  Copyright terms: Public domain W3C validator