Theorem fmco 23956

Description: Composition of image filters. (Contributed by Mario Carneiro, 27-Aug-2015.)

Assertion

Ref	Expression
fmco	⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → ((𝑋 FilMap (𝐹 ∘ 𝐺))‘𝐵) = ((𝑋 FilMap 𝐹)‘((𝑌 FilMap 𝐺)‘𝐵)))

Proof of Theorem fmco

Dummy variables 𝑡 𝑠 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl3 1190	. . . . . . . . . . 11 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → 𝐵 ∈ (fBas‘𝑍))
2		ssfg 23867	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (fBas‘𝑍) → 𝐵 ⊆ (𝑍filGen𝐵))
3	1, 2	syl 17	. . . . . . . . . 10 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → 𝐵 ⊆ (𝑍filGen𝐵))
4	3	sseld 3978	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑢 ∈ 𝐵 → 𝑢 ∈ (𝑍filGen𝐵)))
5		simpl2 1189	. . . . . . . . . 10 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → 𝑌 ∈ 𝑊)
6		simprr 771	. . . . . . . . . 10 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → 𝐺:𝑍⟶𝑌)
7		eqid 2726	. . . . . . . . . . . 12 ⊢ (𝑍filGen𝐵) = (𝑍filGen𝐵)
8	7	imaelfm 23946	. . . . . . . . . . 11 ⊢ (((𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍) ∧ 𝐺:𝑍⟶𝑌) ∧ 𝑢 ∈ (𝑍filGen𝐵)) → (𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵))
9	8	ex 411	. . . . . . . . . 10 ⊢ ((𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍) ∧ 𝐺:𝑍⟶𝑌) → (𝑢 ∈ (𝑍filGen𝐵) → (𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵)))
10	5, 1, 6, 9	syl3anc 1368	. . . . . . . . 9 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑢 ∈ (𝑍filGen𝐵) → (𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵)))
11	4, 10	syld 47	. . . . . . . 8 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑢 ∈ 𝐵 → (𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵)))
12	11	imp 405	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) ∧ 𝑢 ∈ 𝐵) → (𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵))
13		imaeq2 6065	. . . . . . . . . . 11 ⊢ (𝑡 = (𝐺 “ 𝑢) → (𝐹 “ 𝑡) = (𝐹 “ (𝐺 “ 𝑢)))
14		imaco 6262	. . . . . . . . . . 11 ⊢ ((𝐹 ∘ 𝐺) “ 𝑢) = (𝐹 “ (𝐺 “ 𝑢))
15	13, 14	eqtr4di 2784	. . . . . . . . . 10 ⊢ (𝑡 = (𝐺 “ 𝑢) → (𝐹 “ 𝑡) = ((𝐹 ∘ 𝐺) “ 𝑢))
16	15	sseq1d 4011	. . . . . . . . 9 ⊢ (𝑡 = (𝐺 “ 𝑢) → ((𝐹 “ 𝑡) ⊆ 𝑠 ↔ ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
17	16	rspcev 3608	. . . . . . . 8 ⊢ (((𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵) ∧ ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠) → ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠)
18	17	ex 411	. . . . . . 7 ⊢ ((𝐺 “ 𝑢) ∈ ((𝑌 FilMap 𝐺)‘𝐵) → (((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠 → ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠))
19	12, 18	syl 17	. . . . . 6 ⊢ ((((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) ∧ 𝑢 ∈ 𝐵) → (((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠 → ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠))
20	19	rexlimdva 3145	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠 → ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠))
21		elfm 23942	. . . . . . . 8 ⊢ ((𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍) ∧ 𝐺:𝑍⟶𝑌) → (𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑢 ∈ 𝐵 (𝐺 “ 𝑢) ⊆ 𝑡)))
22	5, 1, 6, 21	syl3anc 1368	. . . . . . 7 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵) ↔ (𝑡 ⊆ 𝑌 ∧ ∃𝑢 ∈ 𝐵 (𝐺 “ 𝑢) ⊆ 𝑡)))
23		sstr2 3986	. . . . . . . . . . 11 ⊢ (((𝐹 ∘ 𝐺) “ 𝑢) ⊆ (𝐹 “ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑠 → ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
24		imass2 6112	. . . . . . . . . . . 12 ⊢ ((𝐺 “ 𝑢) ⊆ 𝑡 → (𝐹 “ (𝐺 “ 𝑢)) ⊆ (𝐹 “ 𝑡))
25	14, 24	eqsstrid 4028	. . . . . . . . . . 11 ⊢ ((𝐺 “ 𝑢) ⊆ 𝑡 → ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ (𝐹 “ 𝑡))
26	23, 25	syl11 33	. . . . . . . . . 10 ⊢ ((𝐹 “ 𝑡) ⊆ 𝑠 → ((𝐺 “ 𝑢) ⊆ 𝑡 → ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
27	26	reximdv 3160	. . . . . . . . 9 ⊢ ((𝐹 “ 𝑡) ⊆ 𝑠 → (∃𝑢 ∈ 𝐵 (𝐺 “ 𝑢) ⊆ 𝑡 → ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
28	27	com12 32	. . . . . . . 8 ⊢ (∃𝑢 ∈ 𝐵 (𝐺 “ 𝑢) ⊆ 𝑡 → ((𝐹 “ 𝑡) ⊆ 𝑠 → ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
29	28	adantl 480	. . . . . . 7 ⊢ ((𝑡 ⊆ 𝑌 ∧ ∃𝑢 ∈ 𝐵 (𝐺 “ 𝑢) ⊆ 𝑡) → ((𝐹 “ 𝑡) ⊆ 𝑠 → ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
30	22, 29	biimtrdi 252	. . . . . 6 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵) → ((𝐹 “ 𝑡) ⊆ 𝑠 → ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠)))
31	30	rexlimdv 3143	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠 → ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠))
32	20, 31	impbid 211	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠 ↔ ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠))
33	32	anbi2d 628	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → ((𝑠 ⊆ 𝑋 ∧ ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠) ↔ (𝑠 ⊆ 𝑋 ∧ ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠)))
34		simpl1 1188	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → 𝑋 ∈ 𝑉)
35		fco 6752	. . . . 5 ⊢ ((𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌) → (𝐹 ∘ 𝐺):𝑍⟶𝑋)
36	35	adantl 480	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝐹 ∘ 𝐺):𝑍⟶𝑋)
37		elfm 23942	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝐵 ∈ (fBas‘𝑍) ∧ (𝐹 ∘ 𝐺):𝑍⟶𝑋) → (𝑠 ∈ ((𝑋 FilMap (𝐹 ∘ 𝐺))‘𝐵) ↔ (𝑠 ⊆ 𝑋 ∧ ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠)))
38	34, 1, 36, 37	syl3anc 1368	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑠 ∈ ((𝑋 FilMap (𝐹 ∘ 𝐺))‘𝐵) ↔ (𝑠 ⊆ 𝑋 ∧ ∃𝑢 ∈ 𝐵 ((𝐹 ∘ 𝐺) “ 𝑢) ⊆ 𝑠)))
39		fmfil 23939	. . . . . 6 ⊢ ((𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍) ∧ 𝐺:𝑍⟶𝑌) → ((𝑌 FilMap 𝐺)‘𝐵) ∈ (Fil‘𝑌))
40	5, 1, 6, 39	syl3anc 1368	. . . . 5 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → ((𝑌 FilMap 𝐺)‘𝐵) ∈ (Fil‘𝑌))
41		filfbas 23843	. . . . 5 ⊢ (((𝑌 FilMap 𝐺)‘𝐵) ∈ (Fil‘𝑌) → ((𝑌 FilMap 𝐺)‘𝐵) ∈ (fBas‘𝑌))
42	40, 41	syl 17	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → ((𝑌 FilMap 𝐺)‘𝐵) ∈ (fBas‘𝑌))
43		simprl 769	. . . 4 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → 𝐹:𝑌⟶𝑋)
44		elfm 23942	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ ((𝑌 FilMap 𝐺)‘𝐵) ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → (𝑠 ∈ ((𝑋 FilMap 𝐹)‘((𝑌 FilMap 𝐺)‘𝐵)) ↔ (𝑠 ⊆ 𝑋 ∧ ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠)))
45	34, 42, 43, 44	syl3anc 1368	. . 3 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑠 ∈ ((𝑋 FilMap 𝐹)‘((𝑌 FilMap 𝐺)‘𝐵)) ↔ (𝑠 ⊆ 𝑋 ∧ ∃𝑡 ∈ ((𝑌 FilMap 𝐺)‘𝐵)(𝐹 “ 𝑡) ⊆ 𝑠)))
46	33, 38, 45	3bitr4d 310	. 2 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → (𝑠 ∈ ((𝑋 FilMap (𝐹 ∘ 𝐺))‘𝐵) ↔ 𝑠 ∈ ((𝑋 FilMap 𝐹)‘((𝑌 FilMap 𝐺)‘𝐵))))
47	46	eqrdv 2724	1 ⊢ (((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑊 ∧ 𝐵 ∈ (fBas‘𝑍)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐺:𝑍⟶𝑌)) → ((𝑋 FilMap (𝐹 ∘ 𝐺))‘𝐵) = ((𝑋 FilMap 𝐹)‘((𝑌 FilMap 𝐺)‘𝐵)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   ∧ w3a 1084   = wceq 1534   ∈ wcel 2099  ∃wrex 3060   ⊆ wss 3947   “ cima 5685   ∘ ccom 5686  ⟶wf 6550  ‘cfv 6554  (class class class)co 7424  fBascfbas 21331  filGencfg 21332  Filcfil 23840   FilMap cfm 23928

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2697  ax-rep 5290  ax-sep 5304  ax-nul 5311  ax-pow 5369  ax-pr 5433

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2704  df-cleq 2718  df-clel 2803  df-nfc 2878  df-ne 2931  df-nel 3037  df-ral 3052  df-rex 3061  df-reu 3365  df-rab 3420  df-v 3464  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4326  df-if 4534  df-pw 4609  df-sn 4634  df-pr 4636  df-op 4640  df-uni 4914  df-iun 5003  df-br 5154  df-opab 5216  df-mpt 5237  df-id 5580  df-xp 5688  df-rel 5689  df-cnv 5690  df-co 5691  df-dm 5692  df-rn 5693  df-res 5694  df-ima 5695  df-iota 6506  df-fun 6556  df-fn 6557  df-f 6558  df-f1 6559  df-fo 6560  df-f1o 6561  df-fv 6562  df-ov 7427  df-oprab 7428  df-mpo 7429  df-fbas 21340  df-fg 21341  df-fil 23841  df-fm 23933

This theorem is referenced by:  ufldom  23957  flfcnp  23999