Theorem fmf 21559

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 6577	. . . 4 ⊢ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))) ∈ V
2		eqid 2610	. . . 4 ⊢ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) = (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))))
3	1, 2	fnmpti 5935	. . 3 ⊢ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) Fn (fBas‘𝑌)
4		df-fm 21552	. . . . . 6 ⊢ FilMap = (𝑥 ∈ V, 𝑓 ∈ V ↦ (𝑏 ∈ (fBas‘dom 𝑓) ↦ (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)))))
5	4	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → FilMap = (𝑥 ∈ V, 𝑓 ∈ V ↦ (𝑏 ∈ (fBas‘dom 𝑓) ↦ (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦))))))
6		dmeq 5246	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → dom 𝑓 = dom 𝐹)
7	6	adantl 481	. . . . . . . 8 ⊢ ((𝑥 = 𝑋 ∧ 𝑓 = 𝐹) → dom 𝑓 = dom 𝐹)
8		fdm 5964	. . . . . . . . 9 ⊢ (𝐹:𝑌⟶𝑋 → dom 𝐹 = 𝑌)
9	8	3ad2ant3 1077	. . . . . . . 8 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → dom 𝐹 = 𝑌)
10	7, 9	sylan9eqr 2666	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → dom 𝑓 = 𝑌)
11	10	fveq2d 6107	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → (fBas‘dom 𝑓) = (fBas‘𝑌))
12		id 22	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → 𝑥 = 𝑋)
13		imaeq1 5380	. . . . . . . . . 10 ⊢ (𝑓 = 𝐹 → (𝑓 “ 𝑦) = (𝐹 “ 𝑦))
14	13	mpteq2dv 4673	. . . . . . . . 9 ⊢ (𝑓 = 𝐹 → (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)) = (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))
15	14	rneqd 5274	. . . . . . . 8 ⊢ (𝑓 = 𝐹 → ran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)) = ran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))
16	12, 15	oveqan12d 6568	. . . . . . 7 ⊢ ((𝑥 = 𝑋 ∧ 𝑓 = 𝐹) → (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦))) = (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))))
17	16	adantl 481	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦))) = (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦))))
18	11, 17	mpteq12dv 4663	. . . . 5 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑥 = 𝑋 ∧ 𝑓 = 𝐹)) → (𝑏 ∈ (fBas‘dom 𝑓) ↦ (𝑥filGenran (𝑦 ∈ 𝑏 ↦ (𝑓 “ 𝑦)))) = (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))))
19		elex 3185	. . . . . 6 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ V)
20	19	3ad2ant1 1075	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → 𝑋 ∈ V)
21		fex2 7014	. . . . . 6 ⊢ ((𝐹:𝑌⟶𝑋 ∧ 𝑌 ∈ 𝐵 ∧ 𝑋 ∈ 𝐴) → 𝐹 ∈ V)
22	21	3com13 1262	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → 𝐹 ∈ V)
23		fvex 6113	. . . . . . 7 ⊢ (fBas‘𝑌) ∈ V
24	23	mptex 6390	. . . . . 6 ⊢ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) ∈ V
25	24	a1i 11	. . . . 5 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) ∈ V)
26	5, 18, 20, 22, 25	ovmpt2d 6686	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹) = (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))))
27	26	fneq1d 5895	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹) Fn (fBas‘𝑌) ↔ (𝑏 ∈ (fBas‘𝑌) ↦ (𝑋filGenran (𝑦 ∈ 𝑏 ↦ (𝐹 “ 𝑦)))) Fn (fBas‘𝑌)))
28	3, 27	mpbiri 247	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹) Fn (fBas‘𝑌))
29		simpl1 1057	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → 𝑋 ∈ 𝐴)
30		simpr 476	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → 𝑏 ∈ (fBas‘𝑌))
31		simpl3 1059	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → 𝐹:𝑌⟶𝑋)
32		fmfil 21558	. . . 4 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑏 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋))
33	29, 30, 31, 32	syl3anc 1318	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑏 ∈ (fBas‘𝑌)) → ((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋))
34	33	ralrimiva 2949	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → ∀𝑏 ∈ (fBas‘𝑌)((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋))
35		ffnfv 6295	. 2 ⊢ ((𝑋 FilMap 𝐹):(fBas‘𝑌)⟶(Fil‘𝑋) ↔ ((𝑋 FilMap 𝐹) Fn (fBas‘𝑌) ∧ ∀𝑏 ∈ (fBas‘𝑌)((𝑋 FilMap 𝐹)‘𝑏) ∈ (Fil‘𝑋)))
36	28, 34, 35	sylanbrc 695	1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝐹:𝑌⟶𝑋) → (𝑋 FilMap 𝐹):(fBas‘𝑌)⟶(Fil‘𝑋))

Syntax hints:   → wi 4   ∧ wa 383   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  ∀wral 2896  Vcvv 3173   ↦ cmpt 4643  dom cdm 5038  ran crn 5039   “ cima 5041   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549   ↦ cmpt2 6551  fBascfbas 19555  filGencfg 19556  Filcfil 21459   FilMap cfm 21547

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-oprab 6553  df-mpt2 6554  df-fbas 19564  df-fg 19565  df-fil 21460  df-fm 21552

This theorem is referenced by:  rnelfm  21567