Theorem fmfnfmlem3 24214

Description: Lemma for fmfnfm 24216. (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.

Step	Hyp	Ref	Expression
1		fmfnfm.l	. . . . . . . 8 ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋))
2		filin 24112	. . . . . . . . 9 ⊢ ((𝐿 ∈ (Fil‘𝑋) ∧ 𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿) → (𝑦 ∩ 𝑧) ∈ 𝐿)
3	2	3expb 1138	. . . . . . . 8 ⊢ ((𝐿 ∈ (Fil‘𝑋) ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → (𝑦 ∩ 𝑧) ∈ 𝐿)
4	1, 3	sylan 592	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → (𝑦 ∩ 𝑧) ∈ 𝐿)
5		fmfnfm.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋)
6		ffun 6708	. . . . . . . . 9 ⊢ (𝐹:𝑌⟶𝑋 → Fun 𝐹)
7		funcnvcnv 6603	. . . . . . . . 9 ⊢ (Fun 𝐹 → Fun ◡◡𝐹)
8		imain 6621	. . . . . . . . . 10 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (𝑦 ∩ 𝑧)) = ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)))
9	8	eqcomd 2766	. . . . . . . . 9 ⊢ (Fun ◡◡𝐹 → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
10	5, 6, 7, 9	4syl 20	. . . . . . . 8 ⊢ (𝜑 → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
11	10	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
12		imaeq2 6054	. . . . . . . 8 ⊢ (𝑥 = (𝑦 ∩ 𝑧) → (◡𝐹 “ 𝑥) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
13	12	rspceeqv 3599	. . . . . . 7 ⊢ (((𝑦 ∩ 𝑧) ∈ 𝐿 ∧ ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧))) → ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥))
14	4, 11, 13	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥))
15		ineq12 4161	. . . . . . . 8 ⊢ ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → (𝑠 ∩ 𝑡) = ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)))
16	15	eqeq1d 2762	. . . . . . 7 ⊢ ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ((𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥) ↔ ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥)))
17	16	rexbidv 3186	. . . . . 6 ⊢ ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → (∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥)))
18	14, 17	syl5ibrcom 250	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
19	18	rexlimdvva 3219	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
20		imaeq2 6054	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑦))
21	20	eqeq2d 2771	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑠 = (◡𝐹 “ 𝑥) ↔ 𝑠 = (◡𝐹 “ 𝑦)))
22	21	cbvrexvw 3241	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ↔ ∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦))
23		imaeq2 6054	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑧))
24	23	eqeq2d 2771	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑡 = (◡𝐹 “ 𝑥) ↔ 𝑡 = (◡𝐹 “ 𝑧)))
25	24	cbvrexvw 3241	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥) ↔ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧))
26	22, 25	anbi12i 640	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ∧ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)) ↔ (∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦) ∧ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧)))
27		eqid 2760	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) = (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))
28	27	elrnmpt 5944	. . . . . . 7 ⊢ (𝑠 ∈ V → (𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥)))
29	28	elv 3455	. . . . . 6 ⊢ (𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥))
30	27	elrnmpt 5944	. . . . . . 7 ⊢ (𝑡 ∈ V → (𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)))
31	30	elv 3455	. . . . . 6 ⊢ (𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥))
32	29, 31	anbi12i 640	. . . . 5 ⊢ ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) ↔ (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ∧ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)))
33		reeanv 3234	. . . . 5 ⊢ (∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) ↔ (∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦) ∧ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧)))
34	26, 32, 33	3bitr4i 306	. . . 4 ⊢ ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) ↔ ∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)))
35		vex 3454	. . . . . 6 ⊢ 𝑠 ∈ V
36	35	inex1 5280	. . . . 5 ⊢ (𝑠 ∩ 𝑡) ∈ V
37	27	elrnmpt 5944	. . . . 5 ⊢ ((𝑠 ∩ 𝑡) ∈ V → ((𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
38	36, 37	ax-mp 5	. . . 4 ⊢ ((𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥))
39	19, 34, 38	3imtr4g 299	. . 3 ⊢ (𝜑 → ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) → (𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
40	39	ralrimivv 3203	. 2 ⊢ (𝜑 → ∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)))
41		mptexg 7223	. . 3 ⊢ (𝐿 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V)
42		rnexg 7905	. . 3 ⊢ ((𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V → ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V)
43		inficl 9402	. . 3 ⊢ (ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V → (∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
44	1, 41, 42, 43	4syl 20	. 2 ⊢ (𝜑 → (∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
45	40, 44	mpbid 235	1 ⊢ (𝜑 → (fi‘ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) = ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ∩ cin 3898   ⊆ wss 3899   ↦ cmpt 5186  ^◡ccnv 5654  ran crn 5656   “ cima 5658  Fun wfun 6529  ⟶wf 6531  ‘cfv 6535  (class class class)co 7416  ficfi 9387  fBascfbas 21605  Filcfil 24103   FilMap cfm 24191

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7742

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 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 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6362  df-on 6363  df-lim 6364  df-suc 6365  df-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-om 7869  df-1o 8462  df-2o 8463  df-en 8960  df-fin 8963  df-fi 9388  df-fbas 21614  df-fil 24104

This theorem is used by:  fmfnfmlem4  24215