Theorem ssufl 24084

Description: If 𝑌 is a subset of 𝑋 and filters extend to ultrafilters in 𝑋, then they still do in 𝑌. (Contributed by Mario Carneiro, 26-Aug-2015.)

Assertion

Ref	Expression
ssufl	⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ UFL)

Proof of Theorem ssufl

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

Step	Hyp	Ref	Expression
1		simpll 778	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑋 ∈ UFL)
2		filfbas 24014	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑓 ∈ (fBas‘𝑌))
3	2	adantl 486	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ∈ (fBas‘𝑌))
4		filsspw 24017	. . . . . . . . 9 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑓 ⊆ 𝒫 𝑌)
5	4	adantl 486	. . . . . . . 8 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ 𝒫 𝑌)
6		simplr 780	. . . . . . . . 9 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑌 ⊆ 𝑋)
7	6	sspwd 4575	. . . . . . . 8 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝒫 𝑌 ⊆ 𝒫 𝑋)
8	5, 7	sstrd 3947	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ 𝒫 𝑋)
9		fbasweak 24031	. . . . . . 7 ⊢ ((𝑓 ∈ (fBas‘𝑌) ∧ 𝑓 ⊆ 𝒫 𝑋 ∧ 𝑋 ∈ UFL) → 𝑓 ∈ (fBas‘𝑋))
10	3, 8, 1, 9	syl3anc 1398	. . . . . 6 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ∈ (fBas‘𝑋))
11		fgcl 24044	. . . . . 6 ⊢ (𝑓 ∈ (fBas‘𝑋) → (𝑋filGen𝑓) ∈ (Fil‘𝑋))
12	10, 11	syl 18	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → (𝑋filGen𝑓) ∈ (Fil‘𝑋))
13		ufli 24080	. . . . 5 ⊢ ((𝑋 ∈ UFL ∧ (𝑋filGen𝑓) ∈ (Fil‘𝑋)) → ∃𝑢 ∈ (UFil‘𝑋)(𝑋filGen𝑓) ⊆ 𝑢)
14	1, 12, 13	syl2anc 595	. . . 4 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → ∃𝑢 ∈ (UFil‘𝑋)(𝑋filGen𝑓) ⊆ 𝑢)
15		ssfg 24038	. . . . . . . . . 10 ⊢ (𝑓 ∈ (fBas‘𝑋) → 𝑓 ⊆ (𝑋filGen𝑓))
16	10, 15	syl 18	. . . . . . . . 9 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ (𝑋filGen𝑓))
17	16	adantr 485	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ (𝑋filGen𝑓))
18		simprr 784	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑋filGen𝑓) ⊆ 𝑢)
19	17, 18	sstrd 3947	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ 𝑢)
20		filtop 24021	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑌 ∈ 𝑓)
21	20	ad2antlr 739	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ∈ 𝑓)
22	19, 21	sseldd 3938	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ∈ 𝑢)
23		simprl 782	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑢 ∈ (UFil‘𝑋))
24	6	adantr 485	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ⊆ 𝑋)
25		trufil 24076	. . . . . . 7 ⊢ ((𝑢 ∈ (UFil‘𝑋) ∧ 𝑌 ⊆ 𝑋) → ((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ↔ 𝑌 ∈ 𝑢))
26	23, 24, 25	syl2anc 595	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → ((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ↔ 𝑌 ∈ 𝑢))
27	22, 26	mpbird 260	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑢 ↾t 𝑌) ∈ (UFil‘𝑌))
28	5	adantr 485	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ 𝒫 𝑌)
29		restid2 17487	. . . . . . 7 ⊢ ((𝑌 ∈ 𝑓 ∧ 𝑓 ⊆ 𝒫 𝑌) → (𝑓 ↾t 𝑌) = 𝑓)
30	21, 28, 29	syl2anc 595	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑓 ↾t 𝑌) = 𝑓)
31		ssrest 23342	. . . . . . 7 ⊢ ((𝑢 ∈ (UFil‘𝑋) ∧ 𝑓 ⊆ 𝑢) → (𝑓 ↾t 𝑌) ⊆ (𝑢 ↾t 𝑌))
32	23, 19, 31	syl2anc 595	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑓 ↾t 𝑌) ⊆ (𝑢 ↾t 𝑌))
33	30, 32	eqsstrrd 3972	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ (𝑢 ↾t 𝑌))
34		sseq2 3963	. . . . . 6 ⊢ (𝑔 = (𝑢 ↾t 𝑌) → (𝑓 ⊆ 𝑔 ↔ 𝑓 ⊆ (𝑢 ↾t 𝑌)))
35	34	rspcev 3581	. . . . 5 ⊢ (((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ∧ 𝑓 ⊆ (𝑢 ↾t 𝑌)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
36	27, 33, 35	syl2anc 595	. . . 4 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
37	14, 36	rexlimddv 3172	. . 3 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
38	37	ralrimiva 3157	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
39		ssexg 5290	. . . 4 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑋 ∈ UFL) → 𝑌 ∈ V)
40	39	ancoms 463	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ V)
41		isufl 24079	. . 3 ⊢ (𝑌 ∈ V → (𝑌 ∈ UFL ↔ ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔))
42	40, 41	syl 18	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → (𝑌 ∈ UFL ↔ ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔))
43	38, 42	mpbird 260	1 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ UFL)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1570   ∈ wcel 2143  ∀wral 3079  ∃wrex 3089  Vcvv 3455   ⊆ wss 3905  𝒫 cpw 4562  ‘cfv 6536  (class class class)co 7410   ↾_t crest 17477  fBascfbas 21519  filGencfg 21520  Filcfil 24011  UFilcufil 24065  UFLcufl 24066

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-1st 7982  df-2nd 7983  df-rest 17479  df-fbas 21528  df-fg 21529  df-fil 24012  df-ufil 24067  df-ufl 24068

This theorem is used by:  ufldom  24128