Metamath Proof Explorer

Theorem isfbas

Description: The predicate " F is a filter base." Note that some authors require filter bases to be closed under pairwise intersections, but that is not necessary under our definition. One advantage of this definition is that tails in a directed set form a filter base under our meaning. (Contributed by Jeff Hankins, 1-Sep-2009) (Revised by Mario Carneiro, 28-Jul-2015)

Ref Expression
Assertion isfbas 
|- ( B e. A -> ( F e. ( fBas ` B ) <-> ( F C_ ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) )

Proof

Step Hyp Ref Expression
1 df-fbas 
 |-  fBas = ( z e. _V |-> { w e. ~P ~P z | ( w =/= (/) /\ (/) e/ w /\ A. x e. w A. y e. w ( w i^i ~P ( x i^i y ) ) =/= (/) ) } )
2 neeq1 
 |-  ( w = F -> ( w =/= (/) <-> F =/= (/) ) )
3 neleq2 
 |-  ( w = F -> ( (/) e/ w <-> (/) e/ F ) )
4 ineq1 
 |-  ( w = F -> ( w i^i ~P ( x i^i y ) ) = ( F i^i ~P ( x i^i y ) ) )
5 4 neeq1d 
 |-  ( w = F -> ( ( w i^i ~P ( x i^i y ) ) =/= (/) <-> ( F i^i ~P ( x i^i y ) ) =/= (/) ) )
6 5 raleqbi1dv 
 |-  ( w = F -> ( A. y e. w ( w i^i ~P ( x i^i y ) ) =/= (/) <-> A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) )
7 6 raleqbi1dv 
 |-  ( w = F -> ( A. x e. w A. y e. w ( w i^i ~P ( x i^i y ) ) =/= (/) <-> A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) )
8 2 3 7 3anbi123d 
 |-  ( w = F -> ( ( w =/= (/) /\ (/) e/ w /\ A. x e. w A. y e. w ( w i^i ~P ( x i^i y ) ) =/= (/) ) <-> ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) )
9 8 adantl 
 |-  ( ( z = B /\ w = F ) -> ( ( w =/= (/) /\ (/) e/ w /\ A. x e. w A. y e. w ( w i^i ~P ( x i^i y ) ) =/= (/) ) <-> ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) )
10 pweq 
 |-  ( z = B -> ~P z = ~P B )
11 10 pweqd 
 |-  ( z = B -> ~P ~P z = ~P ~P B )
12 vpwex 
 |-  ~P z e. _V
13 12 pwex 
 |-  ~P ~P z e. _V
14 13 a1i 
 |-  ( z e. _V -> ~P ~P z e. _V )
15 1 9 11 14 elmptrab 
 |-  ( F e. ( fBas ` B ) <-> ( B e. _V /\ F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) )
16 3anass 
 |-  ( ( B e. _V /\ F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) <-> ( B e. _V /\ ( F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) )
17 15 16 bitri 
 |-  ( F e. ( fBas ` B ) <-> ( B e. _V /\ ( F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) )
18 pwexg 
 |-  ( B e. A -> ~P B e. _V )
19 elpw2g 
 |-  ( ~P B e. _V -> ( F e. ~P ~P B <-> F C_ ~P B ) )
20 18 19 syl 
 |-  ( B e. A -> ( F e. ~P ~P B <-> F C_ ~P B ) )
21 20 anbi1d 
 |-  ( B e. A -> ( ( F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) <-> ( F C_ ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) )
22 elex 
 |-  ( B e. A -> B e. _V )
23 22 biantrurd 
 |-  ( B e. A -> ( ( F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) <-> ( B e. _V /\ ( F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) ) )
24 21 23 bitr3d 
 |-  ( B e. A -> ( ( F C_ ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) <-> ( B e. _V /\ ( F e. ~P ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) ) )
25 17 24 bitr4id 
 |-  ( B e. A -> ( F e. ( fBas ` B ) <-> ( F C_ ~P B /\ ( F =/= (/) /\ (/) e/ F /\ A. x e. F A. y e. F ( F i^i ~P ( x i^i y ) ) =/= (/) ) ) ) )