Theorem ssufl 24237

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 779	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑋 ∈ UFL)
2		filfbas 24167	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑓 ∈ (fBas‘𝑌))
3	2	adantl 487	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ∈ (fBas‘𝑌))
4		filsspw 24170	. . . . . . . . 9 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑓 ⊆ 𝒫 𝑌)
5	4	adantl 487	. . . . . . . 8 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ 𝒫 𝑌)
6		simplr 781	. . . . . . . . 9 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑌 ⊆ 𝑋)
7	6	sspwd 4569	. . . . . . . 8 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝒫 𝑌 ⊆ 𝒫 𝑋)
8	5, 7	sstrd 3918	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ 𝒫 𝑋)
9		fbasweak 24184	. . . . . . 7 ⊢ ((𝑓 ∈ (fBas‘𝑌) ∧ 𝑓 ⊆ 𝒫 𝑋 ∧ 𝑋 ∈ UFL) → 𝑓 ∈ (fBas‘𝑋))
10	3, 8, 1, 9	syl3anc 1398	. . . . . 6 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ∈ (fBas‘𝑋))
11		fgcl 24197	. . . . . 6 ⊢ (𝑓 ∈ (fBas‘𝑋) → (𝑋filGen𝑓) ∈ (Fil‘𝑋))
12	10, 11	syl 18	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → (𝑋filGen𝑓) ∈ (Fil‘𝑋))
13		ufli 24233	. . . . 5 ⊢ ((𝑋 ∈ UFL ∧ (𝑋filGen𝑓) ∈ (Fil‘𝑋)) → ∃𝑢 ∈ (UFil‘𝑋)(𝑋filGen𝑓) ⊆ 𝑢)
14	1, 12, 13	syl2anc 596	. . . 4 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → ∃𝑢 ∈ (UFil‘𝑋)(𝑋filGen𝑓) ⊆ 𝑢)
15		ssfg 24191	. . . . . . . . . 10 ⊢ (𝑓 ∈ (fBas‘𝑋) → 𝑓 ⊆ (𝑋filGen𝑓))
16	10, 15	syl 18	. . . . . . . . 9 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ (𝑋filGen𝑓))
17	16	adantr 486	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ (𝑋filGen𝑓))
18		simprr 785	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑋filGen𝑓) ⊆ 𝑢)
19	17, 18	sstrd 3918	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ 𝑢)
20		filtop 24174	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑌 ∈ 𝑓)
21	20	ad2antlr 740	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ∈ 𝑓)
22	19, 21	sseldd 3909	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ∈ 𝑢)
23		simprl 783	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑢 ∈ (UFil‘𝑋))
24	6	adantr 486	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ⊆ 𝑋)
25		trufil 24229	. . . . . . 7 ⊢ ((𝑢 ∈ (UFil‘𝑋) ∧ 𝑌 ⊆ 𝑋) → ((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ↔ 𝑌 ∈ 𝑢))
26	23, 24, 25	syl2anc 596	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → ((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ↔ 𝑌 ∈ 𝑢))
27	22, 26	mpbird 260	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑢 ↾t 𝑌) ∈ (UFil‘𝑌))
28	5	adantr 486	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ 𝒫 𝑌)
29		restid2 17601	. . . . . . 7 ⊢ ((𝑌 ∈ 𝑓 ∧ 𝑓 ⊆ 𝒫 𝑌) → (𝑓 ↾t 𝑌) = 𝑓)
30	21, 28, 29	syl2anc 596	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑓 ↾t 𝑌) = 𝑓)
31		ssrest 23494	. . . . . . 7 ⊢ ((𝑢 ∈ (UFil‘𝑋) ∧ 𝑓 ⊆ 𝑢) → (𝑓 ↾t 𝑌) ⊆ (𝑢 ↾t 𝑌))
32	23, 19, 31	syl2anc 596	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑓 ↾t 𝑌) ⊆ (𝑢 ↾t 𝑌))
33	30, 32	eqsstrrd 3943	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ (𝑢 ↾t 𝑌))
34		sseq2 3934	. . . . . 6 ⊢ (𝑔 = (𝑢 ↾t 𝑌) → (𝑓 ⊆ 𝑔 ↔ 𝑓 ⊆ (𝑢 ↾t 𝑌)))
35	34	rspcev 3576	. . . . 5 ⊢ (((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ∧ 𝑓 ⊆ (𝑢 ↾t 𝑌)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
36	27, 33, 35	syl2anc 596	. . . 4 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
37	14, 36	rexlimddv 3169	. . 3 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
38	37	ralrimiva 3154	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
39		ssexg 5280	. . . 4 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑋 ∈ UFL) → 𝑌 ∈ V)
40	39	ancoms 464	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ V)
41		isufl 24232	. . 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 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895  𝒫 cpw 4556  ‘cfv 6538  (class class class)co 7420   ↾_t crest 17591  fBascfbas 21666  filGencfg 21667  Filcfil 24164  UFilcufil 24218  UFLcufl 24219

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-rest 17593  df-fbas 21675  df-fg 21676  df-fil 24165  df-ufil 24220  df-ufl 24221

This theorem is used by:  ufldom  24281