Theorem fmss 23921

Description: A finer filter produces a finer image filter. (Contributed by Jeff Hankins, 16-Nov-2009.) (Revised by Stefan O'Rear, 6-Aug-2015.)

Assertion

Ref	Expression
fmss	⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ ((𝑋 FilMap 𝐹)‘𝐶))

Proof of Theorem fmss

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl2 1194	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → 𝐵 ∈ (fBas‘𝑌))
2		simprl 771	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → 𝐹:𝑌⟶𝑋)
3		simpl1 1193	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → 𝑋 ∈ 𝐴)
4		eqid 2737	. . . . 5 ⊢ ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) = ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦))
5	4	fbasrn 23859	. . . 4 ⊢ ((𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋 ∧ 𝑋 ∈ 𝐴) → ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ∈ (fBas‘𝑋))
6	1, 2, 3, 5	syl3anc 1374	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ∈ (fBas‘𝑋))
7		simpl3 1195	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → 𝐶 ∈ (fBas‘𝑌))
8		eqid 2737	. . . . 5 ⊢ ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) = ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))
9	8	fbasrn 23859	. . . 4 ⊢ ((𝐶 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋 ∧ 𝑋 ∈ 𝐴) → ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) ∈ (fBas‘𝑋))
10	7, 2, 3, 9	syl3anc 1374	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) ∈ (fBas‘𝑋))
11		resmpt 5996	. . . . . 6 ⊢ (𝐵 ⊆ 𝐶 → ((𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) ↾ 𝐵) = (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)))
12	11	ad2antll 730	. . . . 5 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ((𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) ↾ 𝐵) = (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)))
13		resss 5960	. . . . 5 ⊢ ((𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) ↾ 𝐵) ⊆ (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))
14	12, 13	eqsstrrdi 3968	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ⊆ (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)))
15		rnss 5888	. . . 4 ⊢ ((𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ⊆ (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) → ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ⊆ ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)))
16	14, 15	syl 17	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ⊆ ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)))
17		fgss 23848	. . 3 ⊢ ((ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ∈ (fBas‘𝑋) ∧ ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦)) ∈ (fBas‘𝑋) ∧ ran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦)) ⊆ ran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))) → (𝑋filGenran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦))) ⊆ (𝑋filGenran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))))
18	6, 10, 16, 17	syl3anc 1374	. 2 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → (𝑋filGenran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦))) ⊆ (𝑋filGenran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))))
19		fmval 23918	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐵) = (𝑋filGenran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦))))
20	3, 1, 2, 19	syl3anc 1374	. 2 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ((𝑋 FilMap 𝐹)‘𝐵) = (𝑋filGenran (𝑦 ∈ 𝐵 ↦ (𝐹 “ 𝑦))))
21		fmval 23918	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐶 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐶) = (𝑋filGenran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))))
22	3, 7, 2, 21	syl3anc 1374	. 2 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ((𝑋 FilMap 𝐹)‘𝐶) = (𝑋filGenran (𝑦 ∈ 𝐶 ↦ (𝐹 “ 𝑦))))
23	18, 20, 22	3sstr4d 3978	1 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐵 ∈ (fBas‘𝑌) ∧ 𝐶 ∈ (fBas‘𝑌)) ∧ (𝐹:𝑌⟶𝑋 ∧ 𝐵 ⊆ 𝐶)) → ((𝑋 FilMap 𝐹)‘𝐵) ⊆ ((𝑋 FilMap 𝐹)‘𝐶))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ⊆ wss 3890   ↦ cmpt 5167  ran crn 5625   ↾ cres 5626   “ cima 5627  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360  fBascfbas 21332  filGencfg 21333   FilMap cfm 23908

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-fbas 21341  df-fg 21342  df-fm 23913

This theorem is referenced by:  ufldom  23937  cnpfcfi  24015