Theorem snfil 20093

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	|- ( ( A e. B /\ A =/= (/) ) -> { A } e. ( Fil ` A ) )

Proof of Theorem snfil

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elsn 4034	. . . 4 |- ( x e. { A } <-> x = A )
2		eqimss 3549	. . . . 5 |- ( x = A -> x C_ A )
3	2	pm4.71ri 633	. . . 4 |- ( x = A <-> ( x C_ A /\ x = A ) )
4	1, 3	bitri 249	. . 3 |- ( x e. { A } <-> ( x C_ A /\ x = A ) )
5	4	a1i 11	. 2 |- ( ( A e. B /\ A =/= (/) ) -> ( x e. { A } <-> ( x C_ A /\ x = A ) ) )
6		elex 3115	. . 3 |- ( A e. B -> A e. _V )
7	6	adantr 465	. 2 |- ( ( A e. B /\ A =/= (/) ) -> A e. _V )
8		eqid 2460	. . . 4 |- A = A
9		eqsbc3 3364	. . . 4 |- ( A e. B -> ( [. A / x ]. x = A <-> A = A ) )
10	8, 9	mpbiri 233	. . 3 |- ( A e. B -> [. A / x ]. x = A )
11	10	adantr 465	. 2 |- ( ( A e. B /\ A =/= (/) ) -> [. A / x ]. x = A )
12		simpr 461	. . . . 5 |- ( ( A e. B /\ A =/= (/) ) -> A =/= (/) )
13	12	necomd 2731	. . . 4 |- ( ( A e. B /\ A =/= (/) ) -> (/) =/= A )
14	13	neneqd 2662	. . 3 |- ( ( A e. B /\ A =/= (/) ) -> -. (/) = A )
15		0ex 4570	. . . 4 |- (/) e. _V
16		eqsbc3 3364	. . . 4 |- ( (/) e. _V -> ( [. (/) / x ]. x = A <-> (/) = A ) )
17	15, 16	ax-mp 5	. . 3 |- ( [. (/) / x ]. x = A <-> (/) = A )
18	14, 17	sylnibr 305	. 2 |- ( ( A e. B /\ A =/= (/) ) -> -. [. (/) / x ]. x = A )
19		sseq1 3518	. . . . . . 7 |- ( x = A -> ( x C_ y <-> A C_ y ) )
20	19	anbi2d 703	. . . . . 6 |- ( x = A -> ( ( y C_ A /\ x C_ y ) <-> ( y C_ A /\ A C_ y ) ) )
21		eqss 3512	. . . . . . 7 |- ( y = A <-> ( y C_ A /\ A C_ y ) )
22	21	biimpri 206	. . . . . 6 |- ( ( y C_ A /\ A C_ y ) -> y = A )
23	20, 22	syl6bi 228	. . . . 5 |- ( x = A -> ( ( y C_ A /\ x C_ y ) -> y = A ) )
24	23	com12 31	. . . 4 |- ( ( y C_ A /\ x C_ y ) -> ( x = A -> y = A ) )
25	24	3adant1 1009	. . 3 |- ( ( ( A e. B /\ A =/= (/) ) /\ y C_ A /\ x C_ y ) -> ( x = A -> y = A ) )
26		sbcid 3341	. . 3 |- ( [. x / x ]. x = A <-> x = A )
27		vex 3109	. . . 4 |- y e. _V
28		eqsbc3 3364	. . . 4 |- ( y e. _V -> ( [. y / x ]. x = A <-> y = A ) )
29	27, 28	ax-mp 5	. . 3 |- ( [. y / x ]. x = A <-> y = A )
30	25, 26, 29	3imtr4g 270	. 2 |- ( ( ( A e. B /\ A =/= (/) ) /\ y C_ A /\ x C_ y ) -> ( [. x / x ]. x = A -> [. y / x ]. x = A ) )
31		ineq12 3688	. . . . . 6 |- ( ( y = A /\ x = A ) -> ( y i^i x ) = ( A i^i A ) )
32		inidm 3700	. . . . . 6 |- ( A i^i A ) = A
33	31, 32	syl6eq 2517	. . . . 5 |- ( ( y = A /\ x = A ) -> ( y i^i x ) = A )
34	29, 26, 33	syl2anb 479	. . . 4 |- ( ( [. y / x ]. x = A /\ [. x / x ]. x = A ) -> ( y i^i x ) = A )
35	27	inex1 4581	. . . . 5 |- ( y i^i x ) e. _V
36		eqsbc3 3364	. . . . 5 |- ( ( y i^i x ) e. _V -> ( [. ( y i^i x ) / x ]. x = A <-> ( y i^i x ) = A ) )
37	35, 36	ax-mp 5	. . . 4 |- ( [. ( y i^i x ) / x ]. x = A <-> ( y i^i x ) = A )
38	34, 37	sylibr 212	. . 3 |- ( ( [. y / x ]. x = A /\ [. x / x ]. x = A ) -> [. ( y i^i x ) / x ]. x = A )
39	38	a1i 11	. 2 |- ( ( ( A e. B /\ A =/= (/) ) /\ y C_ A /\ x C_ A ) -> ( ( [. y / x ]. x = A /\ [. x / x ]. x = A ) -> [. ( y i^i x ) / x ]. x = A ) )
40	5, 7, 11, 18, 30, 39	isfild 20087	1 |- ( ( A e. B /\ A =/= (/) ) -> { A } e. ( Fil ` A ) )

Syntax hints:   -> wi 4   <-> wb 184   /\ wa 369   /\ w3a 968   = wceq 1374   e. wcel 1762   =/= wne 2655   _Vcvv 3106   [.wsbc 3324   i^i cin 3468   C_ wss 3469   (/)c0 3778   {csn 4020   ` cfv 5579   Filcfil 20074

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1596  ax-4 1607  ax-5 1675  ax-6 1714  ax-7 1734  ax-8 1764  ax-9 1766  ax-10 1781  ax-11 1786  ax-12 1798  ax-13 1961  ax-ext 2438  ax-sep 4561  ax-nul 4569  ax-pow 4618  ax-pr 4679

This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 970  df-tru 1377  df-ex 1592  df-nf 1595  df-sb 1707  df-eu 2272  df-mo 2273  df-clab 2446  df-cleq 2452  df-clel 2455  df-nfc 2610  df-ne 2657  df-nel 2658  df-ral 2812  df-rex 2813  df-rab 2816  df-v 3108  df-sbc 3325  df-csb 3429  df-dif 3472  df-un 3474  df-in 3476  df-ss 3483  df-nul 3779  df-if 3933  df-pw 4005  df-sn 4021  df-pr 4023  df-op 4027  df-uni 4239  df-br 4441  df-opab 4499  df-mpt 4500  df-id 4788  df-xp 4998  df-rel 4999  df-cnv 5000  df-co 5001  df-dm 5002  df-rn 5003  df-res 5004  df-ima 5005  df-iota 5542  df-fun 5581  df-fv 5587  df-fbas 18180  df-fil 20075

This theorem is referenced by:  snfbas  20095