Theorem snfil 24183

Description: A singleton is a filter. Example 1 of [BourbakiTop1] p. I.36. (Contributed by FL, 16-Sep-2007.) (Revised by Stefan O'Rear, 2-Aug-2015.)

Assertion

Ref	Expression
snfil	⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → {𝐴} ∈ (Fil‘𝐴))

Proof of Theorem snfil

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		velsn 4600	. . . 4 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
2		eqimss 3989	. . . . 5 ⊢ (𝑥 = 𝐴 → 𝑥 ⊆ 𝐴)
3	2	pm4.71ri 570	. . . 4 ⊢ (𝑥 = 𝐴 ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = 𝐴))
4	1, 3	bitri 278	. . 3 ⊢ (𝑥 ∈ {𝐴} ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = 𝐴))
5	4	a1i 11	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → (𝑥 ∈ {𝐴} ↔ (𝑥 ⊆ 𝐴 ∧ 𝑥 = 𝐴)))
6		simpl 488	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → 𝐴 ∈ 𝐵)
7		eqid 2761	. . . 4 ⊢ 𝐴 = 𝐴
8		eqsbc1 3785	. . . 4 ⊢ (𝐴 ∈ 𝐵 → ([𝐴 / 𝑥]𝑥 = 𝐴 ↔ 𝐴 = 𝐴))
9	7, 8	mpbiri 261	. . 3 ⊢ (𝐴 ∈ 𝐵 → [𝐴 / 𝑥]𝑥 = 𝐴)
10	9	adantr 486	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → [𝐴 / 𝑥]𝑥 = 𝐴)
11		simpr 490	. . . . 5 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → 𝐴 ≠ ∅)
12	11	necomd 3011	. . . 4 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → ∅ ≠ 𝐴)
13	12	neneqd 2961	. . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → ¬ ∅ = 𝐴)
14		0ex 5261	. . . 4 ⊢ ∅ ∈ V
15		eqsbc1 3785	. . . 4 ⊢ (∅ ∈ V → ([∅ / 𝑥]𝑥 = 𝐴 ↔ ∅ = 𝐴))
16	14, 15	ax-mp 5	. . 3 ⊢ ([∅ / 𝑥]𝑥 = 𝐴 ↔ ∅ = 𝐴)
17	13, 16	sylnibr 332	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → ¬ [∅ / 𝑥]𝑥 = 𝐴)
18		sseq1 3956	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝑦 ↔ 𝐴 ⊆ 𝑦))
19	18	anbi2d 642	. . . . . 6 ⊢ (𝑥 = 𝐴 → ((𝑦 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝑦) ↔ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝑦)))
20		eqss 3946	. . . . . . 7 ⊢ (𝑦 = 𝐴 ↔ (𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝑦))
21	20	biimpri 231	. . . . . 6 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝐴 ⊆ 𝑦) → 𝑦 = 𝐴)
22	19, 21	biimtrdi 256	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑦 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝑦) → 𝑦 = 𝐴))
23	22	com12 33	. . . 4 ⊢ ((𝑦 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝑦) → (𝑥 = 𝐴 → 𝑦 = 𝐴))
24	23	3adant1 1148	. . 3 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) ∧ 𝑦 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝑦) → (𝑥 = 𝐴 → 𝑦 = 𝐴))
25		sbcid 3756	. . 3 ⊢ ([𝑥 / 𝑥]𝑥 = 𝐴 ↔ 𝑥 = 𝐴)
26		eqsbc1 3785	. . . 4 ⊢ (𝑦 ∈ V → ([𝑦 / 𝑥]𝑥 = 𝐴 ↔ 𝑦 = 𝐴))
27	26	elv 3456	. . 3 ⊢ ([𝑦 / 𝑥]𝑥 = 𝐴 ↔ 𝑦 = 𝐴)
28	24, 25, 27	3imtr4g 299	. 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) ∧ 𝑦 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝑦) → ([𝑥 / 𝑥]𝑥 = 𝐴 → [𝑦 / 𝑥]𝑥 = 𝐴))
29		ineq12 4161	. . . . . 6 ⊢ ((𝑦 = 𝐴 ∧ 𝑥 = 𝐴) → (𝑦 ∩ 𝑥) = (𝐴 ∩ 𝐴))
30		inidm 4172	. . . . . 6 ⊢ (𝐴 ∩ 𝐴) = 𝐴
31	29, 30	eqtrdi 2812	. . . . 5 ⊢ ((𝑦 = 𝐴 ∧ 𝑥 = 𝐴) → (𝑦 ∩ 𝑥) = 𝐴)
32	27, 25, 31	syl2anb 610	. . . 4 ⊢ (([𝑦 / 𝑥]𝑥 = 𝐴 ∧ [𝑥 / 𝑥]𝑥 = 𝐴) → (𝑦 ∩ 𝑥) = 𝐴)
33		vex 3455	. . . . . 6 ⊢ 𝑦 ∈ V
34	33	inex1 5277	. . . . 5 ⊢ (𝑦 ∩ 𝑥) ∈ V
35		eqsbc1 3785	. . . . 5 ⊢ ((𝑦 ∩ 𝑥) ∈ V → ([(𝑦 ∩ 𝑥) / 𝑥]𝑥 = 𝐴 ↔ (𝑦 ∩ 𝑥) = 𝐴))
36	34, 35	ax-mp 5	. . . 4 ⊢ ([(𝑦 ∩ 𝑥) / 𝑥]𝑥 = 𝐴 ↔ (𝑦 ∩ 𝑥) = 𝐴)
37	32, 36	sylibr 237	. . 3 ⊢ (([𝑦 / 𝑥]𝑥 = 𝐴 ∧ [𝑥 / 𝑥]𝑥 = 𝐴) → [(𝑦 ∩ 𝑥) / 𝑥]𝑥 = 𝐴)
38	37	a1i 11	. 2 ⊢ (((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) ∧ 𝑦 ⊆ 𝐴 ∧ 𝑥 ⊆ 𝐴) → (([𝑦 / 𝑥]𝑥 = 𝐴 ∧ [𝑥 / 𝑥]𝑥 = 𝐴) → [(𝑦 ∩ 𝑥) / 𝑥]𝑥 = 𝐴))
39	5, 6, 10, 17, 28, 38	isfild 24177	1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ≠ ∅) → {𝐴} ∈ (Fil‘𝐴))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451  [wsbc 3739   ∩ cin 3898   ⊆ wss 3899  ∅c0 4279  {csn 4584  ‘cfv 6538  Filcfil 24164

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fv 6546  df-fbas 21675  df-fil 24165

This theorem is used by:  snfbas  24185