ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fi0 Unicode version

Theorem fi0 7142
Description: The set of finite intersections of the empty set. (Contributed by Mario Carneiro, 30-Aug-2015.)
Assertion
Ref Expression
fi0  |-  ( fi
`  (/) )  =  (/)

Proof of Theorem fi0
Dummy variables  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 4211 . . 3  |-  (/)  e.  _V
2 fival 7137 . . 3  |-  ( (/)  e.  _V  ->  ( fi `  (/) )  =  {
y  |  E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x } )
31, 2ax-mp 5 . 2  |-  ( fi
`  (/) )  =  {
y  |  E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x }
4 vprc 4216 . . . 4  |-  -.  _V  e.  _V
5 id 19 . . . . . . 7  |-  ( y  =  |^| x  -> 
y  =  |^| x
)
6 elinel1 3390 . . . . . . . . . 10  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  x  e.  ~P (/) )
7 elpwi 3658 . . . . . . . . . 10  |-  ( x  e.  ~P (/)  ->  x  C_  (/) )
8 ss0 3532 . . . . . . . . . 10  |-  ( x 
C_  (/)  ->  x  =  (/) )
96, 7, 83syl 17 . . . . . . . . 9  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  x  =  (/) )
109inteqd 3928 . . . . . . . 8  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  |^| x  =  |^| (/) )
11 int0 3937 . . . . . . . 8  |-  |^| (/)  =  _V
1210, 11eqtrdi 2278 . . . . . . 7  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  |^| x  =  _V )
135, 12sylan9eqr 2284 . . . . . 6  |-  ( ( x  e.  ( ~P (/)  i^i  Fin )  /\  y  =  |^| x )  ->  y  =  _V )
1413rexlimiva 2643 . . . . 5  |-  ( E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x  -> 
y  =  _V )
15 vex 2802 . . . . 5  |-  y  e. 
_V
1614, 15eqeltrrdi 2321 . . . 4  |-  ( E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x  ->  _V  e.  _V )
174, 16mto 666 . . 3  |-  -.  E. x  e.  ( ~P (/) 
i^i  Fin ) y  = 
|^| x
1817abf 3535 . 2  |-  { y  |  E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x }  =  (/)
193, 18eqtri 2250 1  |-  ( fi
`  (/) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1395    e. wcel 2200   {cab 2215   E.wrex 2509   _Vcvv 2799    i^i cin 3196    C_ wss 3197   (/)c0 3491   ~Pcpw 3649   |^|cint 3923   ` cfv 5318   Fincfn 6887   ficfi 7135
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-er 6680  df-en 6888  df-fin 6890  df-fi 7136
This theorem is referenced by:  fieq0  7143
  Copyright terms: Public domain W3C validator