Theorem fmf 23904

Description: Pushing-forward via a function induces a mapping on filters. (Contributed by Stefan O'Rear, 8-Aug-2015.)

Assertion

Ref	Expression
fmf	⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹):(fBas‘𝑌)⟶(Fil‘𝑋))

Proof of Theorem fmf

Dummy variables 𝑓 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ovex 7401	. . . 4 ⊢ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))) ∈ V
2		eqid 2737	. . . 4 ⊢ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) = (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))))
3	1, 2	fnmpti 6643	. . 3 ⊢ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) Fn (fBas‘𝑌)
4		df-fm 23897	. . . . . 6 ⊢ FilMap = (𝑥 ∈ V, 𝑓 ∈ V ↦ (𝑏 ∈ (fBas‘dom 𝑓) ↦ (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)))))
5	4	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → FilMap = (𝑥 ∈ V, 𝑓 ∈ V ↦ (𝑏 ∈ (fBas‘dom 𝑓) ↦ (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦))))))
6		dmeq 5860	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
7	6	adantl 481	. . . . . . . 8 ⊢ ((𝑥 = 𝑋 ∧ 𝑓 = 𝐹) → dom 𝑓 = dom 𝐹)
8		fdm 6679	. . . . . . . . 9 ⊢ (𝐹:𝑌⟶𝑋 → dom 𝐹 = 𝑌)
9	8	3ad2ant3 1136	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → dom 𝐹 = 𝑌)
10	7, 9	sylan9eqr 2794	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → dom 𝑓 = 𝑌)
11	10	fveq2d 6846	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → (fBas‘dom 𝑓) = (fBas‘𝑌))
12		id 22	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋)
13		imaeq1 6022	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓 “ 𝑦) = (𝐹 “ 𝑦))
14	13	mpteq2dv 5194	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)) = (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))
15	14	rneqd 5895	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)) = ran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))
16	12, 15	oveqan12d 7387	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑓 = 𝐹) → (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦))) = (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))))
17	16	adantl 481	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦))) = (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))))
18	11, 17	mpteq12dv 5187	. . . . 5 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → (𝑏 ∈ (fBas‘dom 𝑓) ↦ (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)))) = (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))))
19		elex 3463	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ V)
20	19	3ad2ant1 1134	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → 𝑋 ∈ V)
21		fex2 7888	. . . . . 6 ⊢ ((𝐹:𝑌⟶𝑋 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹 ∈ V)
22	21	3com13 1125	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → 𝐹 ∈ V)
23		fvex 6855	. . . . . . 7 ⊢ (fBas‘𝑌) ∈ V
24	23	mptex 7179	. . . . . 6 ⊢ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) ∈ V
25	24	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) ∈ V)
26	5, 18, 20, 22, 25	ovmpod 7520	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹) = (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))))
27	26	fneq1d 6593	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹) Fn (fBas‘𝑌) ↔ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) Fn (fBas‘𝑌)))
28	3, 27	mpbiri 258	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹) Fn (fBas‘𝑌))
29		simpl1 1193	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → 𝑋 ∈ 𝐴)
30		simpr 484	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → 𝑏 ∈ (fBas‘𝑌))
31		simpl3 1195	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → 𝐹:𝑌⟶𝑋)
32		fmfil 23903	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑏 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋))
33	29, 30, 31, 32	syl3anc 1374	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → ((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋))
34	33	ralrimiva 3130	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → ∀𝑏 ∈ (fBas‘𝑌)((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋))
35		ffnfv 7073	. 2 ⊢ ((𝑋 FilMap 𝐹):(fBas‘𝑌)⟶(Fil‘𝑋) ↔ ((𝑋 FilMap 𝐹) Fn (fBas‘𝑌) ∧ ∀𝑏 ∈ (fBas‘𝑌)((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋)))
36	28, 34, 35	sylanbrc 584	1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹):(fBas‘𝑌)⟶(Fil‘𝑋))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3052  Vcvv 3442   ↦ cmpt 5181  dom cdm 5632  ran crn 5633   “ cima 5635   Fn wfn 6495  ⟶wf 6496  ‘cfv 6500  (class class class)co 7368   ∈ cmpo 7370  fBascfbas 21312  filGencfg 21313  Filcfil 23804   FilMap cfm 23892

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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690

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 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-fbas 21321  df-fg 21322  df-fil 23805  df-fm 23897

This theorem is referenced by:  rnelfm  23912