Theorem fmfnfmlem3 24302

Description: Lemma for fmfnfm 24304. (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 24200	. . . . . . . . 9 ⊢ ((𝐿 ∈ (Fil‘𝑋) ∧ 𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿) → (𝑦 ∩ 𝑧) ∈ 𝐿)
3	2	3expb 1138	. . . . . . . 8 ⊢ ((𝐿 ∈ (Fil‘𝑋) ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → (𝑦 ∩ 𝑧) ∈ 𝐿)
4	1, 3	sylan 592	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → (𝑦 ∩ 𝑧) ∈ 𝐿)
5		fmfnfm.f	. . . . . . . . 9 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋)
6		ffun 6731	. . . . . . . . 9 ⊢ (𝐹:𝑌⟶𝑋 → Fun 𝐹)
7		funcnvcnv 6626	. . . . . . . . 9 ⊢ (Fun 𝐹 → Fun ◡◡𝐹)
8		imain 6644	. . . . . . . . . 10 ⊢ (Fun ◡◡𝐹 → (◡𝐹 “ (𝑦 ∩ 𝑧)) = ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)))
9	8	eqcomd 2769	. . . . . . . . 9 ⊢ (Fun ◡◡𝐹 → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
10	5, 6, 7, 9	4syl 20	. . . . . . . 8 ⊢ (𝜑 → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
11	10	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
12		imaeq2 6059	. . . . . . . 8 ⊢ (𝑥 = (𝑦 ∩ 𝑧) → (◡𝐹 “ 𝑥) = (◡𝐹 “ (𝑦 ∩ 𝑧)))
13	12	rspceeqv 3602	. . . . . . 7 ⊢ (((𝑦 ∩ 𝑧) ∈ 𝐿 ∧ ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ (𝑦 ∩ 𝑧))) → ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥))
14	4, 11, 13	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥))
15		ineq12 4115	. . . . . . . 8 ⊢ ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → (𝑠 ∩ 𝑡) = ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)))
16	15	eqeq1d 2765	. . . . . . 7 ⊢ ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ((𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥) ↔ ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥)))
17	16	rexbidv 3190	. . . . . 6 ⊢ ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → (∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥) ↔ ∃𝑥 ∈ 𝐿 ((◡𝐹 “ 𝑦) ∩ (◡𝐹 “ 𝑧)) = (◡𝐹 “ 𝑥)))
18	14, 17	syl5ibrcom 250	. . . . 5 ⊢ ((𝜑 ∧ (𝑦 ∈ 𝐿 ∧ 𝑧 ∈ 𝐿)) → ((𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
19	18	rexlimdvva 3223	. . . 4 ⊢ (𝜑 → (∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) → ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
20		imaeq2 6059	. . . . . . . 8 ⊢ (𝑥 = 𝑦 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑦))
21	20	eqeq2d 2774	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑠 = (◡𝐹 “ 𝑥) ↔ 𝑠 = (◡𝐹 “ 𝑦)))
22	21	cbvrexvw 3245	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ↔ ∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦))
23		imaeq2 6059	. . . . . . . 8 ⊢ (𝑥 = 𝑧 → (◡𝐹 “ 𝑥) = (◡𝐹 “ 𝑧))
24	23	eqeq2d 2774	. . . . . . 7 ⊢ (𝑥 = 𝑧 → (𝑡 = (◡𝐹 “ 𝑥) ↔ 𝑡 = (◡𝐹 “ 𝑧)))
25	24	cbvrexvw 3245	. . . . . 6 ⊢ (∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥) ↔ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧))
26	22, 25	anbi12i 640	. . . . 5 ⊢ ((∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ∧ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)) ↔ (∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦) ∧ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧)))
27		eqid 2763	. . . . . . . 8 ⊢ (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) = (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))
28	27	elrnmpt 5946	. . . . . . 7 ⊢ (𝑠 ∈ V → (𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥)))
29	28	elv 3459	. . . . . 6 ⊢ (𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥))
30	27	elrnmpt 5946	. . . . . . 7 ⊢ (𝑡 ∈ V → (𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)))
31	30	elv 3459	. . . . . 6 ⊢ (𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥))
32	29, 31	anbi12i 640	. . . . 5 ⊢ ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) ↔ (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) ∧ ∃𝑥 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑥)))
33		reeanv 3238	. . . . 5 ⊢ (∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)) ↔ (∃𝑦 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑦) ∧ ∃𝑧 ∈ 𝐿 𝑡 = (◡𝐹 “ 𝑧)))
34	26, 32, 33	3bitr4i 306	. . . 4 ⊢ ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) ↔ ∃𝑦 ∈ 𝐿 ∃𝑧 ∈ 𝐿 (𝑠 = (◡𝐹 “ 𝑦) ∧ 𝑡 = (◡𝐹 “ 𝑧)))
35		vex 3458	. . . . . 6 ⊢ 𝑠 ∈ V
36	35	inex1 5281	. . . . 5 ⊢ (𝑠 ∩ 𝑡) ∈ V
37	27	elrnmpt 5946	. . . . 5 ⊢ ((𝑠 ∩ 𝑡) ∈ V → ((𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥)))
38	36, 37	ax-mp 5	. . . 4 ⊢ ((𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ↔ ∃𝑥 ∈ 𝐿 (𝑠 ∩ 𝑡) = (◡𝐹 “ 𝑥))
39	19, 34, 38	3imtr4g 299	. . 3 ⊢ (𝜑 → ((𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∧ 𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))) → (𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))))
40	39	ralrimivv 3207	. 2 ⊢ (𝜑 → ∀𝑠 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))∀𝑡 ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥))(𝑠 ∩ 𝑡) ∈ ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)))
41		mptexg 7247	. . 3 ⊢ (𝐿 ∈ (Fil‘𝑋) → (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V)
42		rnexg 7935	. . 3 ⊢ ((𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V → ran (𝑥 ∈ 𝐿 ↦ (◡𝐹 “ 𝑥)) ∈ V)
43		inficl 9441	. . 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 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092   ↦ cmpt 5189  ^◡ccnv 5654  ran crn 5656   “ cima 5658  Fun wfun 6549  ⟶wf 6551  ‘cfv 6555  (class class class)co 7440  ficfi 9426  fBascfbas 21693  Filcfil 24191   FilMap cfm 24279

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 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7772

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 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-pss 4017  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-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  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 6380  df-on 6381  df-lim 6382  df-suc 6383  df-iota 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-om 7899  df-1o 8501  df-2o 8502  df-en 8999  df-fin 9002  df-fi 9427  df-fbas 21702  df-fil 24192

This theorem is used by:  fmfnfmlem4  24303