Theorem fmfnfmlem2 24213

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
fmfnfmlem2	⊢ (𝜑 → (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))))

Distinct variable groups:   𝑡,𝑠,𝑥,𝐵   𝐹,𝑠,𝑡,𝑥   𝐿,𝑠,𝑡,𝑥   𝜑,𝑠,𝑡,𝑥   𝑋,𝑠,𝑡,𝑥   𝑌,𝑠,𝑡,𝑥

Proof of Theorem fmfnfmlem2

Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fmfnfm.l	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ (Fil‘𝑋))
2	1	ad2antrr 739	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → 𝐿 ∈ (Fil‘𝑋))
3		simplr 781	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → 𝑥 ∈ 𝐿)
4		fmfnfm.fm	. . . . . . . 8 ⊢ (𝜑 → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ 𝐿)
5		fmfnfm.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝐹:𝑌⟶𝑋)
6		ffn 6705	. . . . . . . . . . 11 ⊢ (𝐹:𝑌⟶𝑋 → 𝐹 Fn 𝑌)
7		dffn4 6798	. . . . . . . . . . 11 ⊢ (𝐹 Fn 𝑌 ↔ 𝐹:𝑌–onto→ran 𝐹)
8	6, 7	sylib 221	. . . . . . . . . 10 ⊢ (𝐹:𝑌⟶𝑋 → 𝐹:𝑌–onto→ran 𝐹)
9		foima 6797	. . . . . . . . . 10 ⊢ (𝐹:𝑌–onto→ran 𝐹 → (𝐹 “ 𝑌) = ran 𝐹)
10	5, 8, 9	3syl 19	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 “ 𝑌) = ran 𝐹)
11		filtop 24113	. . . . . . . . . . 11 ⊢ (𝐿 ∈ (Fil‘𝑋) → 𝑋 ∈ 𝐿)
12	1, 11	syl 18	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ 𝐿)
13		fmfnfm.b	. . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ (fBas‘𝑌))
14		fgcl 24136	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑌) → (𝑌filGen𝐵) ∈ (Fil‘𝑌))
15		filtop 24113	. . . . . . . . . . 11 ⊢ ((𝑌filGen𝐵) ∈ (Fil‘𝑌) → 𝑌 ∈ (𝑌filGen𝐵))
16	13, 14, 15	3syl 19	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ (𝑌filGen𝐵))
17		eqid 2760	. . . . . . . . . . 11 ⊢ (𝑌filGen𝐵) = (𝑌filGen𝐵)
18	17	imaelfm 24209	. . . . . . . . . 10 ⊢ (((𝑋 ∈ 𝐿 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑌 ∈ (𝑌filGen𝐵)) → (𝐹 “ 𝑌) ∈ ((𝑋 FilMap 𝐹)‘𝐵))
19	12, 13, 5, 16, 18	syl31anc 1400	. . . . . . . . 9 ⊢ (𝜑 → (𝐹 “ 𝑌) ∈ ((𝑋 FilMap 𝐹)‘𝐵))
20	10, 19	eqeltrrd 2861	. . . . . . . 8 ⊢ (𝜑 → ran 𝐹 ∈ ((𝑋 FilMap 𝐹)‘𝐵))
21	4, 20	sseldd 3932	. . . . . . 7 ⊢ (𝜑 → ran 𝐹 ∈ 𝐿)
22	21	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → ran 𝐹 ∈ 𝐿)
23		filin 24112	. . . . . 6 ⊢ ((𝐿 ∈ (Fil‘𝑋) ∧ 𝑥 ∈ 𝐿 ∧ ran 𝐹 ∈ 𝐿) → (𝑥 ∩ ran 𝐹) ∈ 𝐿)
24	2, 3, 22, 23	syl3anc 1398	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → (𝑥 ∩ ran 𝐹) ∈ 𝐿)
25		simprr 785	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → 𝑡 ⊆ 𝑋)
26		elin 3915	. . . . . . 7 ⊢ (𝑦 ∈ (𝑥 ∩ ran 𝐹) ↔ (𝑦 ∈ 𝑥 ∧ 𝑦 ∈ ran 𝐹))
27		fvelrnb 6941	. . . . . . . . . . . 12 ⊢ (𝐹 Fn 𝑌 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑧 ∈ 𝑌 (𝐹‘𝑧) = 𝑦))
28	5, 6, 27	3syl 19	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑦 ∈ ran 𝐹 ↔ ∃𝑧 ∈ 𝑌 (𝐹‘𝑧) = 𝑦))
29	28	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ (𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡) → (𝑦 ∈ ran 𝐹 ↔ ∃𝑧 ∈ 𝑌 (𝐹‘𝑧) = 𝑦))
30	5	ffund 6710	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → Fun 𝐹)
31	30	ad2antrr 739	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → Fun 𝐹)
32		simprr 785	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → 𝑧 ∈ 𝑌)
33	5	fdmd 6716	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → dom 𝐹 = 𝑌)
34	33	ad2antrr 739	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → dom 𝐹 = 𝑌)
35	32, 34	eleqtrrd 2863	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → 𝑧 ∈ dom 𝐹)
36		fvimacnv 7048	. . . . . . . . . . . . . . 15 ⊢ ((Fun 𝐹 ∧ 𝑧 ∈ dom 𝐹) → ((𝐹‘𝑧) ∈ 𝑥 ↔ 𝑧 ∈ (◡𝐹 “ 𝑥)))
37	31, 35, 36	syl2anc 596	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → ((𝐹‘𝑧) ∈ 𝑥 ↔ 𝑧 ∈ (◡𝐹 “ 𝑥)))
38		cnvimass 6080	. . . . . . . . . . . . . . . 16 ⊢ (◡𝐹 “ 𝑥) ⊆ dom 𝐹
39		funfvima2 7233	. . . . . . . . . . . . . . . 16 ⊢ ((Fun 𝐹 ∧ (◡𝐹 “ 𝑥) ⊆ dom 𝐹) → (𝑧 ∈ (◡𝐹 “ 𝑥) → (𝐹‘𝑧) ∈ (𝐹 “ (◡𝐹 “ 𝑥))))
40	31, 38, 39	sylancl 598	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → (𝑧 ∈ (◡𝐹 “ 𝑥) → (𝐹‘𝑧) ∈ (𝐹 “ (◡𝐹 “ 𝑥))))
41		ssel 3925	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 → ((𝐹‘𝑧) ∈ (𝐹 “ (◡𝐹 “ 𝑥)) → (𝐹‘𝑧) ∈ 𝑡))
42	41	ad2antrl 741	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → ((𝐹‘𝑧) ∈ (𝐹 “ (◡𝐹 “ 𝑥)) → (𝐹‘𝑧) ∈ 𝑡))
43	40, 42	syld 48	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → (𝑧 ∈ (◡𝐹 “ 𝑥) → (𝐹‘𝑧) ∈ 𝑡))
44	37, 43	sylbid 243	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → ((𝐹‘𝑧) ∈ 𝑥 → (𝐹‘𝑧) ∈ 𝑡))
45		eleq1 2848	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑧) = 𝑦 → ((𝐹‘𝑧) ∈ 𝑥 ↔ 𝑦 ∈ 𝑥))
46		eleq1 2848	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘𝑧) = 𝑦 → ((𝐹‘𝑧) ∈ 𝑡 ↔ 𝑦 ∈ 𝑡))
47	45, 46	imbi12d 347	. . . . . . . . . . . . 13 ⊢ ((𝐹‘𝑧) = 𝑦 → (((𝐹‘𝑧) ∈ 𝑥 → (𝐹‘𝑧) ∈ 𝑡) ↔ (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑡)))
48	44, 47	syl5ibcom 248	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑧 ∈ 𝑌)) → ((𝐹‘𝑧) = 𝑦 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑡)))
49	48	expr 462	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ (𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡) → (𝑧 ∈ 𝑌 → ((𝐹‘𝑧) = 𝑦 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑡))))
50	49	rexlimdv 3161	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ (𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡) → (∃𝑧 ∈ 𝑌 (𝐹‘𝑧) = 𝑦 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑡)))
51	29, 50	sylbid 243	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ (𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡) → (𝑦 ∈ ran 𝐹 → (𝑦 ∈ 𝑥 → 𝑦 ∈ 𝑡)))
52	51	impcomd 417	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ (𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡) → ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ ran 𝐹) → 𝑦 ∈ 𝑡))
53	52	adantrr 730	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → ((𝑦 ∈ 𝑥 ∧ 𝑦 ∈ ran 𝐹) → 𝑦 ∈ 𝑡))
54	26, 53	biimtrid 245	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → (𝑦 ∈ (𝑥 ∩ ran 𝐹) → 𝑦 ∈ 𝑡))
55	54	ssrdv 3937	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → (𝑥 ∩ ran 𝐹) ⊆ 𝑡)
56		filss 24111	. . . . 5 ⊢ ((𝐿 ∈ (Fil‘𝑋) ∧ ((𝑥 ∩ ran 𝐹) ∈ 𝐿 ∧ 𝑡 ⊆ 𝑋 ∧ (𝑥 ∩ ran 𝐹) ⊆ 𝑡)) → 𝑡 ∈ 𝐿)
57	2, 24, 25, 55, 56	syl13anc 1399	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐿) ∧ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 ∧ 𝑡 ⊆ 𝑋)) → 𝑡 ∈ 𝐿)
58	57	exp32 426	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐿) → ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿)))
59		imaeq2 6054	. . . . 5 ⊢ (𝑠 = (◡𝐹 “ 𝑥) → (𝐹 “ 𝑠) = (𝐹 “ (◡𝐹 “ 𝑥)))
60	59	sseq1d 3962	. . . 4 ⊢ (𝑠 = (◡𝐹 “ 𝑥) → ((𝐹 “ 𝑠) ⊆ 𝑡 ↔ (𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡))
61	60	imbi1d 344	. . 3 ⊢ (𝑠 = (◡𝐹 “ 𝑥) → (((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿)) ↔ ((𝐹 “ (◡𝐹 “ 𝑥)) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))))
62	58, 61	syl5ibrcom 250	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐿) → (𝑠 = (◡𝐹 “ 𝑥) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))))
63	62	rexlimdva 3163	1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐿 𝑠 = (◡𝐹 “ 𝑥) → ((𝐹 “ 𝑠) ⊆ 𝑡 → (𝑡 ⊆ 𝑋 → 𝑡 ∈ 𝐿))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∃wrex 3086   ∩ cin 3898   ⊆ wss 3899  ^◡ccnv 5654  dom cdm 5655  ran crn 5656   “ cima 5658  Fun wfun 6529   Fn wfn 6530  ⟶wf 6531  –onto→wfo 6533  ‘cfv 6535  (class class class)co 7416  fBascfbas 21605  filGencfg 21606  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

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  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-iota 6491  df-fun 6537  df-fn 6538  df-f 6539  df-f1 6540  df-fo 6541  df-f1o 6542  df-fv 6543  df-ov 7419  df-oprab 7420  df-mpo 7421  df-fbas 21614  df-fg 21615  df-fil 24104  df-fm 24196

This theorem is used by:  fmfnfmlem4  24215