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

Theorem fmfnfmlem3 23943
Description: Lemma for fmfnfm 23945. (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 23841 . . . . . . . . 9 ((𝐿 ∈ (Fil‘𝑋) ∧ 𝑦𝐿𝑧𝐿) → (𝑦𝑧) ∈ 𝐿)
323expb 1127 . . . . . . . 8 ((𝐿 ∈ (Fil‘𝑋) ∧ (𝑦𝐿𝑧𝐿)) → (𝑦𝑧) ∈ 𝐿)
41, 3sylan 587 . . . . . . 7 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → (𝑦𝑧) ∈ 𝐿)
5 fmfnfm.f . . . . . . . . 9 (𝜑𝐹:𝑌𝑋)
6 ffun 6662 . . . . . . . . 9 (𝐹:𝑌𝑋 → Fun 𝐹)
7 funcnvcnv 6556 . . . . . . . . 9 (Fun 𝐹 → Fun 𝐹)
8 imain 6574 . . . . . . . . . 10 (Fun 𝐹 → (𝐹 “ (𝑦𝑧)) = ((𝐹𝑦) ∩ (𝐹𝑧)))
98eqcomd 2747 . . . . . . . . 9 (Fun 𝐹 → ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧)))
105, 6, 7, 94syl 19 . . . . . . . 8 (𝜑 → ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧)))
1110adantr 482 . . . . . . 7 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧)))
12 imaeq2 6015 . . . . . . . 8 (𝑥 = (𝑦𝑧) → (𝐹𝑥) = (𝐹 “ (𝑦𝑧)))
1312rspceeqv 3585 . . . . . . 7 (((𝑦𝑧) ∈ 𝐿 ∧ ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹 “ (𝑦𝑧))) → ∃𝑥𝐿 ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥))
144, 11, 13syl2anc 591 . . . . . 6 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → ∃𝑥𝐿 ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥))
15 ineq12 4147 . . . . . . . 8 ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → (𝑠𝑡) = ((𝐹𝑦) ∩ (𝐹𝑧)))
1615eqeq1d 2743 . . . . . . 7 ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → ((𝑠𝑡) = (𝐹𝑥) ↔ ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥)))
1716rexbidv 3165 . . . . . 6 ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → (∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥) ↔ ∃𝑥𝐿 ((𝐹𝑦) ∩ (𝐹𝑧)) = (𝐹𝑥)))
1814, 17syl5ibrcom 249 . . . . 5 ((𝜑 ∧ (𝑦𝐿𝑧𝐿)) → ((𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥)))
1918rexlimdvva 3198 . . . 4 (𝜑 → (∃𝑦𝐿𝑧𝐿 (𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) → ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥)))
20 imaeq2 6015 . . . . . . . 8 (𝑥 = 𝑦 → (𝐹𝑥) = (𝐹𝑦))
2120eqeq2d 2752 . . . . . . 7 (𝑥 = 𝑦 → (𝑠 = (𝐹𝑥) ↔ 𝑠 = (𝐹𝑦)))
2221cbvrexvw 3220 . . . . . 6 (∃𝑥𝐿 𝑠 = (𝐹𝑥) ↔ ∃𝑦𝐿 𝑠 = (𝐹𝑦))
23 imaeq2 6015 . . . . . . . 8 (𝑥 = 𝑧 → (𝐹𝑥) = (𝐹𝑧))
2423eqeq2d 2752 . . . . . . 7 (𝑥 = 𝑧 → (𝑡 = (𝐹𝑥) ↔ 𝑡 = (𝐹𝑧)))
2524cbvrexvw 3220 . . . . . 6 (∃𝑥𝐿 𝑡 = (𝐹𝑥) ↔ ∃𝑧𝐿 𝑡 = (𝐹𝑧))
2622, 25anbi12i 635 . . . . 5 ((∃𝑥𝐿 𝑠 = (𝐹𝑥) ∧ ∃𝑥𝐿 𝑡 = (𝐹𝑥)) ↔ (∃𝑦𝐿 𝑠 = (𝐹𝑦) ∧ ∃𝑧𝐿 𝑡 = (𝐹𝑧)))
27 eqid 2741 . . . . . . . 8 (𝑥𝐿 ↦ (𝐹𝑥)) = (𝑥𝐿 ↦ (𝐹𝑥))
2827elrnmpt 5907 . . . . . . 7 (𝑠 ∈ V → (𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑠 = (𝐹𝑥)))
2928elv 3438 . . . . . 6 (𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑠 = (𝐹𝑥))
3027elrnmpt 5907 . . . . . . 7 (𝑡 ∈ V → (𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑡 = (𝐹𝑥)))
3130elv 3438 . . . . . 6 (𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 𝑡 = (𝐹𝑥))
3229, 31anbi12i 635 . . . . 5 ((𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ∧ 𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))) ↔ (∃𝑥𝐿 𝑠 = (𝐹𝑥) ∧ ∃𝑥𝐿 𝑡 = (𝐹𝑥)))
33 reeanv 3213 . . . . 5 (∃𝑦𝐿𝑧𝐿 (𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)) ↔ (∃𝑦𝐿 𝑠 = (𝐹𝑦) ∧ ∃𝑧𝐿 𝑡 = (𝐹𝑧)))
3426, 32, 333bitr4i 305 . . . 4 ((𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ∧ 𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))) ↔ ∃𝑦𝐿𝑧𝐿 (𝑠 = (𝐹𝑦) ∧ 𝑡 = (𝐹𝑧)))
35 vex 3437 . . . . . 6 𝑠 ∈ V
3635inex1 5248 . . . . 5 (𝑠𝑡) ∈ V
3727elrnmpt 5907 . . . . 5 ((𝑠𝑡) ∈ V → ((𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥)))
3836, 37ax-mp 5 . . . 4 ((𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ ∃𝑥𝐿 (𝑠𝑡) = (𝐹𝑥))
3919, 34, 383imtr4g 298 . . 3 (𝜑 → ((𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ∧ 𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))) → (𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))))
4039ralrimivv 3182 . 2 (𝜑 → ∀𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))∀𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))(𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)))
41 mptexg 7169 . . 3 (𝐿 ∈ (Fil‘𝑋) → (𝑥𝐿 ↦ (𝐹𝑥)) ∈ V)
42 rnexg 7846 . . 3 ((𝑥𝐿 ↦ (𝐹𝑥)) ∈ V → ran (𝑥𝐿 ↦ (𝐹𝑥)) ∈ V)
43 inficl 9332 . . 3 (ran (𝑥𝐿 ↦ (𝐹𝑥)) ∈ V → (∀𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))∀𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))(𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ (fi‘ran (𝑥𝐿 ↦ (𝐹𝑥))) = ran (𝑥𝐿 ↦ (𝐹𝑥))))
441, 41, 42, 434syl 19 . 2 (𝜑 → (∀𝑠 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))∀𝑡 ∈ ran (𝑥𝐿 ↦ (𝐹𝑥))(𝑠𝑡) ∈ ran (𝑥𝐿 ↦ (𝐹𝑥)) ↔ (fi‘ran (𝑥𝐿 ↦ (𝐹𝑥))) = ran (𝑥𝐿 ↦ (𝐹𝑥))))
4540, 44mpbid 234 1 (𝜑 → (fi‘ran (𝑥𝐿 ↦ (𝐹𝑥))) = ran (𝑥𝐿 ↦ (𝐹𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wral 3055  wrex 3065  Vcvv 3433  cin 3884  wss 3885  cmpt 5156  ccnv 5620  ran crn 5622  cima 5624  Fun wfun 6483  wf 6485  cfv 6489  (class class class)co 7360  ficfi 9317  fBascfbas 21339  Filcfil 23832   FilMap cfm 23920
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5202  ax-sep 5221  ax-nul 5231  ax-pow 5297  ax-pr 5365  ax-un 7682
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3726  df-csb 3834  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-pss 3905  df-nul 4265  df-if 4458  df-pw 4534  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-int 4881  df-iun 4926  df-br 5076  df-opab 5138  df-mpt 5157  df-tr 5183  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-om 7811  df-1o 8399  df-2o 8400  df-en 8888  df-fin 8891  df-fi 9318  df-fbas 21348  df-fil 23833
This theorem is referenced by:  fmfnfmlem4  23944
  Copyright terms: Public domain W3C validator