Theorem fmufil 23924

Description: An image filter of an ultrafilter is an ultrafilter. (Contributed by Jeff Hankins, 11-Dec-2009.) (Revised by Stefan O'Rear, 8-Aug-2015.)

Assertion

Ref	Expression
fmufil	⊢ ((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋))

Proof of Theorem fmufil

Dummy variables 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ufilfil 23869	. . . 4 ⊢ (𝐿 ∈ (UFil‘𝑌) → 𝐿 ∈ (Fil‘𝑌))
2		filfbas 23813	. . . 4 ⊢ (𝐿 ∈ (Fil‘𝑌) → 𝐿 ∈ (fBas‘𝑌))
3	1, 2	syl 17	. . 3 ⊢ (𝐿 ∈ (UFil‘𝑌) → 𝐿 ∈ (fBas‘𝑌))
4		fmfil 23909	. . 3 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (fBas‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (Fil‘𝑋))
5	3, 4	syl3an2 1165	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (Fil‘𝑋))
6		simpl2 1194	. . . . . . 7 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → 𝐿 ∈ (UFil‘𝑌))
7	6, 1, 2	3syl 18	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → 𝐿 ∈ (fBas‘𝑌))
8		simprl 771	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → 𝑓 ∈ (Fil‘𝑋))
9		simpl3 1195	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → 𝐹:𝑌⟶𝑋)
10		simprr 773	. . . . . 6 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)
11	7, 8, 9, 10	fmfnfm 23923	. . . . 5 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → ∃𝑔 ∈ (Fil‘𝑌)(𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))
12	6	adantr 480	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → 𝐿 ∈ (UFil‘𝑌))
13		simprl 771	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → 𝑔 ∈ (Fil‘𝑌))
14		simprrl 781	. . . . . . . 8 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → 𝐿 ⊆ 𝑔)
15		ufilmax 23872	. . . . . . . 8 ⊢ ((𝐿 ∈ (UFil‘𝑌) ∧ 𝑔 ∈ (Fil‘𝑌) ∧ 𝐿 ⊆ 𝑔) → 𝐿 = 𝑔)
16	12, 13, 14, 15	syl3anc 1374	. . . . . . 7 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → 𝐿 = 𝑔)
17	16	fveq2d 6844	. . . . . 6 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → ((𝑋 FilMap 𝐹)‘𝐿) = ((𝑋 FilMap 𝐹)‘𝑔))
18		simprrr 782	. . . . . 6 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔))
19	17, 18	eqtr4d 2774	. . . . 5 ⊢ ((((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) ∧ (𝑔 ∈ (Fil‘𝑌) ∧ (𝐿 ⊆ 𝑔 ∧ 𝑓 = ((𝑋 FilMap 𝐹)‘𝑔)))) → ((𝑋 FilMap 𝐹)‘𝐿) = 𝑓)
20	11, 19	rexlimddv 3144	. . . 4 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ (𝑓 ∈ (Fil‘𝑋) ∧ ((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓)) → ((𝑋 FilMap 𝐹)‘𝐿) = 𝑓)
21	20	expr 456	. . 3 ⊢ (((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) ∧ 𝑓 ∈ (Fil‘𝑋)) → (((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓 → ((𝑋 FilMap 𝐹)‘𝐿) = 𝑓))
22	21	ralrimiva 3129	. 2 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ∀𝑓 ∈ (Fil‘𝑋)(((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓 → ((𝑋 FilMap 𝐹)‘𝐿) = 𝑓))
23		isufil2 23873	. 2 ⊢ (((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋) ↔ (((𝑋 FilMap 𝐹)‘𝐿) ∈ (Fil‘𝑋) ∧ ∀𝑓 ∈ (Fil‘𝑋)(((𝑋 FilMap 𝐹)‘𝐿) ⊆ 𝑓 → ((𝑋 FilMap 𝐹)‘𝐿) = 𝑓)))
24	5, 22, 23	sylanbrc 584	1 ⊢ ((𝑋 ∈ 𝐴 ∧ 𝐿 ∈ (UFil‘𝑌) ∧ 𝐹:𝑌⟶𝑋) → ((𝑋 FilMap 𝐹)‘𝐿) ∈ (UFil‘𝑋))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∀wral 3051   ⊆ wss 3889  ⟶wf 6494  ‘cfv 6498  (class class class)co 7367  fBascfbas 21340  Filcfil 23810  UFilcufil 23864   FilMap cfm 23898

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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1o 8405  df-2o 8406  df-en 8894  df-fin 8897  df-fi 9324  df-fbas 21349  df-fg 21350  df-fil 23811  df-ufil 23866  df-fm 23903

This theorem is referenced by:  ufldom  23927  uffcfflf  24004