Theorem supfil 22506

Description: The supersets of a nonempty set which are also subsets of a given base set form a filter. (Contributed by Jeff Hankins, 12-Nov-2009.) (Revised by Stefan O'Rear, 7-Aug-2015.)

Assertion

Ref	Expression
supfil	⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ∈ (Fil‘𝐴))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem supfil

Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sseq2 3996	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐵 ⊆ 𝑥 ↔ 𝐵 ⊆ 𝑦))
2	1	elrab 3683	. . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ∈ 𝒫 𝐴 ∧ 𝐵 ⊆ 𝑦))
3		velpw 4547	. . . . 5 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴)
4	3	anbi1i 625	. . . 4 ⊢ ((𝑦 ∈ 𝒫 𝐴 ∧ 𝐵 ⊆ 𝑦) ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦))
5	2, 4	bitri 277	. . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦))
6	5	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦)))
7		elex 3515	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
8	7	3ad2ant1 1129	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → 𝐴 ∈ V)
9		simp2 1133	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → 𝐵 ⊆ 𝐴)
10		sseq2 3996	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
11	10	sbcieg 3813	. . . 4 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
12	8, 11	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ([𝐴 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
13	9, 12	mpbird 259	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → [𝐴 / 𝑦]𝐵 ⊆ 𝑦)
14		ss0 4355	. . . . 5 ⊢ (𝐵 ⊆ ∅ → 𝐵 = ∅)
15	14	necon3ai 3044	. . . 4 ⊢ (𝐵 ≠ ∅ → ¬ 𝐵 ⊆ ∅)
16	15	3ad2ant3 1131	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ¬ 𝐵 ⊆ ∅)
17		0ex 5214	. . . 4 ⊢ ∅ ∈ V
18		sseq2 3996	. . . 4 ⊢ (𝑦 = ∅ → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ ∅))
19	17, 18	sbcie 3815	. . 3 ⊢ ([∅ / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ ∅)
20	16, 19	sylnibr 331	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ¬ [∅ / 𝑦]𝐵 ⊆ 𝑦)
21		sstr 3978	. . . . 5 ⊢ ((𝐵 ⊆ 𝑤 ∧ 𝑤 ⊆ 𝑧) → 𝐵 ⊆ 𝑧)
22	21	expcom 416	. . . 4 ⊢ (𝑤 ⊆ 𝑧 → (𝐵 ⊆ 𝑤 → 𝐵 ⊆ 𝑧))
23		vex 3500	. . . . 5 ⊢ 𝑤 ∈ V
24		sseq2 3996	. . . . 5 ⊢ (𝑦 = 𝑤 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑤))
25	23, 24	sbcie 3815	. . . 4 ⊢ ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑤)
26		vex 3500	. . . . 5 ⊢ 𝑧 ∈ V
27		sseq2 3996	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑧))
28	26, 27	sbcie 3815	. . . 4 ⊢ ([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑧)
29	22, 25, 28	3imtr4g 298	. . 3 ⊢ (𝑤 ⊆ 𝑧 → ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 → [𝑧 / 𝑦]𝐵 ⊆ 𝑦))
30	29	3ad2ant3 1131	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) ∧ 𝑧 ⊆ 𝐴 ∧ 𝑤 ⊆ 𝑧) → ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 → [𝑧 / 𝑦]𝐵 ⊆ 𝑦))
31		ssin 4210	. . . . . 6 ⊢ ((𝐵 ⊆ 𝑧 ∧ 𝐵 ⊆ 𝑤) ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤))
32	31	biimpi 218	. . . . 5 ⊢ ((𝐵 ⊆ 𝑧 ∧ 𝐵 ⊆ 𝑤) → 𝐵 ⊆ (𝑧 ∩ 𝑤))
33	28, 25, 32	syl2anb 599	. . . 4 ⊢ (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → 𝐵 ⊆ (𝑧 ∩ 𝑤))
34	26	inex1 5224	. . . . 5 ⊢ (𝑧 ∩ 𝑤) ∈ V
35		sseq2 3996	. . . . 5 ⊢ (𝑦 = (𝑧 ∩ 𝑤) → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤)))
36	34, 35	sbcie 3815	. . . 4 ⊢ ([(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤))
37	33, 36	sylibr 236	. . 3 ⊢ (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → [(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦)
38	37	a1i 11	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) ∧ 𝑧 ⊆ 𝐴 ∧ 𝑤 ⊆ 𝐴) → (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → [(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦))
39	6, 8, 13, 20, 30, 38	isfild 22469	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ∈ (Fil‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   ∈ wcel 2113   ≠ wne 3019  {crab 3145  Vcvv 3497  [wsbc 3775   ∩ cin 3938   ⊆ wss 3939  ∅c0 4294  𝒫 cpw 4542  ‘cfv 6358  Filcfil 22456

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-op 4577  df-uni 4842  df-br 5070  df-opab 5132  df-mpt 5150  df-id 5463  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-iota 6317  df-fun 6360  df-fv 6366  df-fbas 20545  df-fil 22457

This theorem is referenced by:  fclscf  22636  flimfnfcls  22639