Theorem supfil 24269

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 3939	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐵 ⊆ 𝑥 ↔ 𝐵 ⊆ 𝑦))
2	1	elrab 3648	. . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ∈ 𝒫 𝐴 ∧ 𝐵 ⊆ 𝑦))
3		velpw 4565	. . . . 5 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴)
4	3	anbi1i 636	. . . 4 ⊢ ((𝑦 ∈ 𝒫 𝐴 ∧ 𝐵 ⊆ 𝑦) ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦))
5	2, 4	bitri 278	. . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦))
6	5	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦)))
7		simp1 1154	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → 𝐴 ∈ 𝑉)
8		simp2 1155	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → 𝐵 ⊆ 𝐴)
9		sseq2 3939	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
10	9	sbcieg 3781	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ([𝐴 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
11	7, 10	syl 18	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ([𝐴 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
12	8, 11	mpbird 260	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → [𝐴 / 𝑦]𝐵 ⊆ 𝑦)
13		ss0 4355	. . . . 5 ⊢ (𝐵 ⊆ ∅ → 𝐵 = ∅)
14	13	necon3ai 2984	. . . 4 ⊢ (𝐵 ≠ ∅ → ¬ 𝐵 ⊆ ∅)
15	14	3ad2ant3 1153	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ¬ 𝐵 ⊆ ∅)
16		0ex 5267	. . . 4 ⊢ ∅ ∈ V
17		sseq2 3939	. . . 4 ⊢ (𝑦 = ∅ → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ ∅))
18	16, 17	sbcie 3783	. . 3 ⊢ ([∅ / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ ∅)
19	15, 18	sylnibr 332	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ¬ [∅ / 𝑦]𝐵 ⊆ 𝑦)
20		sstr 3921	. . . . 5 ⊢ ((𝐵 ⊆ 𝑤 ∧ 𝑤 ⊆ 𝑧) → 𝐵 ⊆ 𝑧)
21	20	expcom 419	. . . 4 ⊢ (𝑤 ⊆ 𝑧 → (𝐵 ⊆ 𝑤 → 𝐵 ⊆ 𝑧))
22		vex 3458	. . . . 5 ⊢ 𝑤 ∈ V
23		sseq2 3939	. . . . 5 ⊢ (𝑦 = 𝑤 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑤))
24	22, 23	sbcie 3783	. . . 4 ⊢ ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑤)
25		vex 3458	. . . . 5 ⊢ 𝑧 ∈ V
26		sseq2 3939	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑧))
27	25, 26	sbcie 3783	. . . 4 ⊢ ([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑧)
28	21, 24, 27	3imtr4g 299	. . 3 ⊢ (𝑤 ⊆ 𝑧 → ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 → [𝑧 / 𝑦]𝐵 ⊆ 𝑦))
29	28	3ad2ant3 1153	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) ∧ 𝑧 ⊆ 𝐴 ∧ 𝑤 ⊆ 𝑧) → ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 → [𝑧 / 𝑦]𝐵 ⊆ 𝑦))
30		ssin 4138	. . . . . 6 ⊢ ((𝐵 ⊆ 𝑧 ∧ 𝐵 ⊆ 𝑤) ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤))
31	30	biimpi 219	. . . . 5 ⊢ ((𝐵 ⊆ 𝑧 ∧ 𝐵 ⊆ 𝑤) → 𝐵 ⊆ (𝑧 ∩ 𝑤))
32	27, 24, 31	syl2anb 610	. . . 4 ⊢ (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → 𝐵 ⊆ (𝑧 ∩ 𝑤))
33	25	inex1 5284	. . . . 5 ⊢ (𝑧 ∩ 𝑤) ∈ V
34		sseq2 3939	. . . . 5 ⊢ (𝑦 = (𝑧 ∩ 𝑤) → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤)))
35	33, 34	sbcie 3783	. . . 4 ⊢ ([(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤))
36	32, 35	sylibr 237	. . 3 ⊢ (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → [(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦)
37	36	a1i 11	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) ∧ 𝑧 ⊆ 𝐴 ∧ 𝑤 ⊆ 𝐴) → (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → [(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦))
38	6, 7, 12, 19, 29, 37	isfild 24232	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ∈ (Fil‘𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2147   ≠ wne 2959  {crab 3416  [wsbc 3742   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  𝒫 cpw 4560  ‘cfv 6566  Filcfil 24219

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-fbas 21726  df-fil 24220

This theorem is used by:  fclscf  24399  flimfnfcls  24402