Theorem elfg 20879

Description: A condition for elements of a generated filter. (Contributed by Jeff Hankins, 3-Sep-2009.) (Revised by Stefan O'Rear, 2-Aug-2015.)

Assertion

Ref	Expression
elfg	|- ( F e. ( fBas ` X ) -> ( A e. ( X filGen F ) <-> ( A C_ X /\ E. x e. F x C_ A ) ) )

Distinct variable groups:   x, A   x, F

Allowed substitution hint:   X( x)

Proof of Theorem elfg

Dummy variable y is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fgval 20878	. . 3 |- ( F e. ( fBas ` X ) -> ( X filGen F ) = { y e. ~P X | ( F i^i ~P y ) =/= (/) } )
2	1	eleq2d 2513	. 2 |- ( F e. ( fBas ` X ) -> ( A e. ( X filGen F ) <-> A e. { y e. ~P X | ( F i^i ~P y ) =/= (/) } ) )
3		pweq 3953	. . . . . 6 |- ( y = A -> ~P y = ~P A )
4	3	ineq2d 3633	. . . . 5 |- ( y = A -> ( F i^i ~P y ) = ( F i^i ~P A ) )
5	4	neeq1d 2682	. . . 4 |- ( y = A -> ( ( F i^i ~P y ) =/= (/) <-> ( F i^i ~P A ) =/= (/) ) )
6	5	elrab 3195	. . 3 |- ( A e. { y e. ~P X | ( F i^i ~P y ) =/= (/) } <-> ( A e. ~P X /\ ( F i^i ~P A ) =/= (/) ) )
7		elfvdm 5889	. . . . 5 |- ( F e. ( fBas ` X ) -> X e. dom fBas )
8		elpw2g 4565	. . . . 5 |- ( X e. dom fBas -> ( A e. ~P X <-> A C_ X ) )
9	7, 8	syl 17	. . . 4 |- ( F e. ( fBas ` X ) -> ( A e. ~P X <-> A C_ X ) )
10		elin 3616	. . . . . . . 8 |- ( x e. ( F i^i ~P A ) <-> ( x e. F /\ x e. ~P A ) )
11		selpw 3957	. . . . . . . . 9 |- ( x e. ~P A <-> x C_ A )
12	11	anbi2i 699	. . . . . . . 8 |- ( ( x e. F /\ x e. ~P A ) <-> ( x e. F /\ x C_ A ) )
13	10, 12	bitri 253	. . . . . . 7 |- ( x e. ( F i^i ~P A ) <-> ( x e. F /\ x C_ A ) )
14	13	exbii 1717	. . . . . 6 |- ( E. x x e. ( F i^i ~P A ) <-> E. x ( x e. F /\ x C_ A ) )
15		n0 3740	. . . . . 6 |- ( ( F i^i ~P A ) =/= (/) <-> E. x x e. ( F i^i ~P A ) )
16		df-rex 2742	. . . . . 6 |- ( E. x e. F x C_ A <-> E. x ( x e. F /\ x C_ A ) )
17	14, 15, 16	3bitr4i 281	. . . . 5 |- ( ( F i^i ~P A ) =/= (/) <-> E. x e. F x C_ A )
18	17	a1i 11	. . . 4 |- ( F e. ( fBas ` X ) -> ( ( F i^i ~P A ) =/= (/) <-> E. x e. F x C_ A ) )
19	9, 18	anbi12d 716	. . 3 |- ( F e. ( fBas ` X ) -> ( ( A e. ~P X /\ ( F i^i ~P A ) =/= (/) ) <-> ( A C_ X /\ E. x e. F x C_ A ) ) )
20	6, 19	syl5bb 261	. 2 |- ( F e. ( fBas ` X ) -> ( A e. { y e. ~P X | ( F i^i ~P y ) =/= (/) } <-> ( A C_ X /\ E. x e. F x C_ A ) ) )
21	2, 20	bitrd 257	1 |- ( F e. ( fBas ` X ) -> ( A e. ( X filGen F ) <-> ( A C_ X /\ E. x e. F x C_ A ) ) )

Syntax hints:   -> wi 4   <-> wb 188   /\ wa 371   = wceq 1443   E.wex 1662   e. wcel 1886   =/= wne 2621   E.wrex 2737   {crab 2740   i^i cin 3402   C_ wss 3403   (/)c0 3730   ~Pcpw 3950   dom cdm 4833   ` cfv 5581  (class class class)co 6288   fBascfbas 18951   filGencfg 18952

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1668  ax-4 1681  ax-5 1757  ax-6 1804  ax-7 1850  ax-8 1888  ax-9 1895  ax-10 1914  ax-11 1919  ax-12 1932  ax-13 2090  ax-ext 2430  ax-sep 4524  ax-nul 4533  ax-pow 4580  ax-pr 4638

This theorem depends on definitions:  df-bi 189  df-or 372  df-an 373  df-3an 986  df-tru 1446  df-ex 1663  df-nf 1667  df-sb 1797  df-eu 2302  df-mo 2303  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2580  df-ne 2623  df-ral 2741  df-rex 2742  df-rab 2745  df-v 3046  df-sbc 3267  df-dif 3406  df-un 3408  df-in 3410  df-ss 3417  df-nul 3731  df-if 3881  df-pw 3952  df-sn 3968  df-pr 3970  df-op 3974  df-uni 4198  df-br 4402  df-opab 4461  df-id 4748  df-xp 4839  df-rel 4840  df-cnv 4841  df-co 4842  df-dm 4843  df-iota 5545  df-fun 5583  df-fv 5589  df-ov 6291  df-oprab 6292  df-mpt2 6293  df-fg 18961

This theorem is referenced by:  ssfg  20880  fgss  20881  fgss2  20882  fgfil  20883  elfilss  20884  fgcl  20886  fgabs  20887  fgtr  20898  trfg  20899  uffix  20929  elfm  20955  elfm2  20956  elfm3  20958  fbflim  20984  flffbas  21003  fclsbas  21029  isucn2  21287  metust  21566  cfilucfil  21567  metuel  21572  fgcfil  22234  fgmin  31019  filnetlem4  31030