Theorem ssufl 21722

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 790	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑋 ∈ UFL)
2		filfbas 21652	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑓 ∈ (fBas‘𝑌))
3	2	adantl 482	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ∈ (fBas‘𝑌))
4		filsspw 21655	. . . . . . . . 9 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑓 ⊆ 𝒫 𝑌)
5	4	adantl 482	. . . . . . . 8 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ 𝒫 𝑌)
6		simplr 792	. . . . . . . . 9 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑌 ⊆ 𝑋)
7		sspwb 4917	. . . . . . . . 9 ⊢ (𝑌 ⊆ 𝑋 ↔ 𝒫 𝑌 ⊆ 𝒫 𝑋)
8	6, 7	sylib 208	. . . . . . . 8 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝒫 𝑌 ⊆ 𝒫 𝑋)
9	5, 8	sstrd 3613	. . . . . . 7 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ 𝒫 𝑋)
10		fbasweak 21669	. . . . . . 7 ⊢ ((𝑓 ∈ (fBas‘𝑌) ∧ 𝑓 ⊆ 𝒫 𝑋 ∧ 𝑋 ∈ UFL) → 𝑓 ∈ (fBas‘𝑋))
11	3, 9, 1, 10	syl3anc 1326	. . . . . 6 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ∈ (fBas‘𝑋))
12		fgcl 21682	. . . . . 6 ⊢ (𝑓 ∈ (fBas‘𝑋) → (𝑋filGen𝑓) ∈ (Fil‘𝑋))
13	11, 12	syl 17	. . . . 5 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → (𝑋filGen𝑓) ∈ (Fil‘𝑋))
14		ufli 21718	. . . . 5 ⊢ ((𝑋 ∈ UFL ∧ (𝑋filGen𝑓) ∈ (Fil‘𝑋)) → ∃𝑢 ∈ (UFil‘𝑋)(𝑋filGen𝑓) ⊆ 𝑢)
15	1, 13, 14	syl2anc 693	. . . 4 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → ∃𝑢 ∈ (UFil‘𝑋)(𝑋filGen𝑓) ⊆ 𝑢)
16		ssfg 21676	. . . . . . . . . 10 ⊢ (𝑓 ∈ (fBas‘𝑋) → 𝑓 ⊆ (𝑋filGen𝑓))
17	11, 16	syl 17	. . . . . . . . 9 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → 𝑓 ⊆ (𝑋filGen𝑓))
18	17	adantr 481	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ (𝑋filGen𝑓))
19		simprr 796	. . . . . . . 8 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑋filGen𝑓) ⊆ 𝑢)
20	18, 19	sstrd 3613	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ 𝑢)
21		filtop 21659	. . . . . . . 8 ⊢ (𝑓 ∈ (Fil‘𝑌) → 𝑌 ∈ 𝑓)
22	21	ad2antlr 763	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ∈ 𝑓)
23	20, 22	sseldd 3604	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ∈ 𝑢)
24		simprl 794	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑢 ∈ (UFil‘𝑋))
25	6	adantr 481	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑌 ⊆ 𝑋)
26		trufil 21714	. . . . . . 7 ⊢ ((𝑢 ∈ (UFil‘𝑋) ∧ 𝑌 ⊆ 𝑋) → ((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ↔ 𝑌 ∈ 𝑢))
27	24, 25, 26	syl2anc 693	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → ((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ↔ 𝑌 ∈ 𝑢))
28	23, 27	mpbird 247	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑢 ↾t 𝑌) ∈ (UFil‘𝑌))
29	5	adantr 481	. . . . . . 7 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ 𝒫 𝑌)
30		restid2 16091	. . . . . . 7 ⊢ ((𝑌 ∈ 𝑓 ∧ 𝑓 ⊆ 𝒫 𝑌) → (𝑓 ↾t 𝑌) = 𝑓)
31	22, 29, 30	syl2anc 693	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑓 ↾t 𝑌) = 𝑓)
32		ssrest 20980	. . . . . . 7 ⊢ ((𝑢 ∈ (UFil‘𝑋) ∧ 𝑓 ⊆ 𝑢) → (𝑓 ↾t 𝑌) ⊆ (𝑢 ↾t 𝑌))
33	24, 20, 32	syl2anc 693	. . . . . 6 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → (𝑓 ↾t 𝑌) ⊆ (𝑢 ↾t 𝑌))
34	31, 33	eqsstr3d 3640	. . . . 5 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → 𝑓 ⊆ (𝑢 ↾t 𝑌))
35		sseq2 3627	. . . . . 6 ⊢ (𝑔 = (𝑢 ↾t 𝑌) → (𝑓 ⊆ 𝑔 ↔ 𝑓 ⊆ (𝑢 ↾t 𝑌)))
36	35	rspcev 3309	. . . . 5 ⊢ (((𝑢 ↾t 𝑌) ∈ (UFil‘𝑌) ∧ 𝑓 ⊆ (𝑢 ↾t 𝑌)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
37	28, 34, 36	syl2anc 693	. . . 4 ⊢ ((((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) ∧ (𝑢 ∈ (UFil‘𝑋) ∧ (𝑋filGen𝑓) ⊆ 𝑢)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
38	15, 37	rexlimddv 3035	. . 3 ⊢ (((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) ∧ 𝑓 ∈ (Fil‘𝑌)) → ∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
39	38	ralrimiva 2966	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔)
40		ssexg 4804	. . . 4 ⊢ ((𝑌 ⊆ 𝑋 ∧ 𝑋 ∈ UFL) → 𝑌 ∈ V)
41	40	ancoms 469	. . 3 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ V)
42		isufl 21717	. . 3 ⊢ (𝑌 ∈ V → (𝑌 ∈ UFL ↔ ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔))
43	41, 42	syl 17	. 2 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → (𝑌 ∈ UFL ↔ ∀𝑓 ∈ (Fil‘𝑌)∃𝑔 ∈ (UFil‘𝑌)𝑓 ⊆ 𝑔))
44	39, 43	mpbird 247	1 ⊢ ((𝑋 ∈ UFL ∧ 𝑌 ⊆ 𝑋) → 𝑌 ∈ UFL)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483   ∈ wcel 1990  ∀wral 2912  ∃wrex 2913  Vcvv 3200   ⊆ wss 3574  𝒫 cpw 4158  ‘cfv 5888  (class class class)co 6650   ↾_t crest 16081  fBascfbas 19734  filGencfg 19735  Filcfil 21649  UFilcufil 21703  UFLcufl 21704

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-nel 2898  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-1st 7168  df-2nd 7169  df-rest 16083  df-fbas 19743  df-fg 19744  df-fil 21650  df-ufil 21705  df-ufl 21706

This theorem is referenced by:  ufldom  21766