Theorem supfil 21977

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 3786	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝐵 ⊆ 𝑥 ↔ 𝐵 ⊆ 𝑦))
2	1	elrab 3518	. . . 4 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ∈ 𝒫 𝐴 ∧ 𝐵 ⊆ 𝑦))
3		selpw 4321	. . . . 5 ⊢ (𝑦 ∈ 𝒫 𝐴 ↔ 𝑦 ⊆ 𝐴)
4	3	anbi1i 617	. . . 4 ⊢ ((𝑦 ∈ 𝒫 𝐴 ∧ 𝐵 ⊆ 𝑦) ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦))
5	2, 4	bitri 266	. . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦))
6	5	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → (𝑦 ∈ {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ↔ (𝑦 ⊆ 𝐴 ∧ 𝐵 ⊆ 𝑦)))
7		elex 3364	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V)
8	7	3ad2ant1 1163	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → 𝐴 ∈ V)
9		simp2 1167	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → 𝐵 ⊆ 𝐴)
10		sseq2 3786	. . . . 5 ⊢ (𝑦 = 𝐴 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
11	10	sbcieg 3628	. . . 4 ⊢ (𝐴 ∈ V → ([𝐴 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
12	8, 11	syl 17	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ([𝐴 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝐴))
13	9, 12	mpbird 248	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → [𝐴 / 𝑦]𝐵 ⊆ 𝑦)
14		ss0 4135	. . . . 5 ⊢ (𝐵 ⊆ ∅ → 𝐵 = ∅)
15	14	necon3ai 2961	. . . 4 ⊢ (𝐵 ≠ ∅ → ¬ 𝐵 ⊆ ∅)
16	15	3ad2ant3 1165	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ¬ 𝐵 ⊆ ∅)
17		0ex 4949	. . . 4 ⊢ ∅ ∈ V
18		sseq2 3786	. . . 4 ⊢ (𝑦 = ∅ → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ ∅))
19	17, 18	sbcie 3630	. . 3 ⊢ ([∅ / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ ∅)
20	16, 19	sylnibr 320	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → ¬ [∅ / 𝑦]𝐵 ⊆ 𝑦)
21		sstr 3768	. . . . 5 ⊢ ((𝐵 ⊆ 𝑤 ∧ 𝑤 ⊆ 𝑧) → 𝐵 ⊆ 𝑧)
22	21	expcom 402	. . . 4 ⊢ (𝑤 ⊆ 𝑧 → (𝐵 ⊆ 𝑤 → 𝐵 ⊆ 𝑧))
23		vex 3352	. . . . 5 ⊢ 𝑤 ∈ V
24		sseq2 3786	. . . . 5 ⊢ (𝑦 = 𝑤 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑤))
25	23, 24	sbcie 3630	. . . 4 ⊢ ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑤)
26		vex 3352	. . . . 5 ⊢ 𝑧 ∈ V
27		sseq2 3786	. . . . 5 ⊢ (𝑦 = 𝑧 → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑧))
28	26, 27	sbcie 3630	. . . 4 ⊢ ([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ 𝑧)
29	22, 25, 28	3imtr4g 287	. . 3 ⊢ (𝑤 ⊆ 𝑧 → ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 → [𝑧 / 𝑦]𝐵 ⊆ 𝑦))
30	29	3ad2ant3 1165	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) ∧ 𝑧 ⊆ 𝐴 ∧ 𝑤 ⊆ 𝑧) → ([𝑤 / 𝑦]𝐵 ⊆ 𝑦 → [𝑧 / 𝑦]𝐵 ⊆ 𝑦))
31		ssin 3993	. . . . . 6 ⊢ ((𝐵 ⊆ 𝑧 ∧ 𝐵 ⊆ 𝑤) ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤))
32	31	biimpi 207	. . . . 5 ⊢ ((𝐵 ⊆ 𝑧 ∧ 𝐵 ⊆ 𝑤) → 𝐵 ⊆ (𝑧 ∩ 𝑤))
33	28, 25, 32	syl2anb 591	. . . 4 ⊢ (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → 𝐵 ⊆ (𝑧 ∩ 𝑤))
34	26	inex1 4959	. . . . 5 ⊢ (𝑧 ∩ 𝑤) ∈ V
35		sseq2 3786	. . . . 5 ⊢ (𝑦 = (𝑧 ∩ 𝑤) → (𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤)))
36	34, 35	sbcie 3630	. . . 4 ⊢ ([(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦 ↔ 𝐵 ⊆ (𝑧 ∩ 𝑤))
37	33, 36	sylibr 225	. . 3 ⊢ (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → [(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦)
38	37	a1i 11	. 2 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) ∧ 𝑧 ⊆ 𝐴 ∧ 𝑤 ⊆ 𝐴) → (([𝑧 / 𝑦]𝐵 ⊆ 𝑦 ∧ [𝑤 / 𝑦]𝐵 ⊆ 𝑦) → [(𝑧 ∩ 𝑤) / 𝑦]𝐵 ⊆ 𝑦))
39	6, 8, 13, 20, 30, 38	isfild 21940	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐵 ≠ ∅) → {𝑥 ∈ 𝒫 𝐴 ∣ 𝐵 ⊆ 𝑥} ∈ (Fil‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 197   ∧ wa 384   ∧ w3a 1107   ∈ wcel 2155   ≠ wne 2936  {crab 3058  Vcvv 3349  [wsbc 3595   ∩ cin 3730   ⊆ wss 3731  ∅c0 4078  𝒫 cpw 4314  ‘cfv 6067  Filcfil 21927

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2069  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2349  ax-ext 2742  ax-sep 4940  ax-nul 4948  ax-pow 5000  ax-pr 5061

This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2062  df-mo 2564  df-eu 2581  df-clab 2751  df-cleq 2757  df-clel 2760  df-nfc 2895  df-ne 2937  df-nel 3040  df-ral 3059  df-rex 3060  df-rab 3063  df-v 3351  df-sbc 3596  df-csb 3691  df-dif 3734  df-un 3736  df-in 3738  df-ss 3745  df-nul 4079  df-if 4243  df-pw 4316  df-sn 4334  df-pr 4336  df-op 4340  df-uni 4594  df-br 4809  df-opab 4871  df-mpt 4888  df-id 5184  df-xp 5282  df-rel 5283  df-cnv 5284  df-co 5285  df-dm 5286  df-rn 5287  df-res 5288  df-ima 5289  df-iota 6030  df-fun 6069  df-fv 6075  df-fbas 20015  df-fil 21928

This theorem is referenced by:  fclscf  22107  flimfnfcls  22110