MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fi0 Unicode version

Theorem fi0 7173
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 4150 . . 3  |-  (/)  e.  _V
2 fival 7166 . . 3  |-  ( (/)  e.  _V  ->  ( fi `  (/) )  =  {
y  |  E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x } )
31, 2ax-mp 8 . 2  |-  ( fi
`  (/) )  =  {
y  |  E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x }
4 vprc 4152 . . . 4  |-  -.  _V  e.  _V
5 id 19 . . . . . . 7  |-  ( y  =  |^| x  -> 
y  =  |^| x
)
6 inss1 3389 . . . . . . . . . . 11  |-  ( ~P (/)  i^i  Fin )  C_  ~P (/)
76sseli 3176 . . . . . . . . . 10  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  x  e.  ~P (/) )
8 elpwi 3633 . . . . . . . . . 10  |-  ( x  e.  ~P (/)  ->  x  C_  (/) )
9 ss0 3485 . . . . . . . . . 10  |-  ( x 
C_  (/)  ->  x  =  (/) )
107, 8, 93syl 18 . . . . . . . . 9  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  x  =  (/) )
1110inteqd 3867 . . . . . . . 8  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  |^| x  =  |^| (/) )
12 int0 3876 . . . . . . . 8  |-  |^| (/)  =  _V
1311, 12syl6eq 2331 . . . . . . 7  |-  ( x  e.  ( ~P (/)  i^i  Fin )  ->  |^| x  =  _V )
145, 13sylan9eqr 2337 . . . . . 6  |-  ( ( x  e.  ( ~P (/)  i^i  Fin )  /\  y  =  |^| x )  ->  y  =  _V )
1514rexlimiva 2662 . . . . 5  |-  ( E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x  -> 
y  =  _V )
16 vex 2791 . . . . 5  |-  y  e. 
_V
1715, 16syl6eqelr 2372 . . . 4  |-  ( E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x  ->  _V  e.  _V )
184, 17mto 167 . . 3  |-  -.  E. x  e.  ( ~P (/) 
i^i  Fin ) y  = 
|^| x
1918abf 3488 . 2  |-  { y  |  E. x  e.  ( ~P (/)  i^i  Fin ) y  =  |^| x }  =  (/)
203, 19eqtri 2303 1  |-  ( fi
`  (/) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1623    e. wcel 1684   {cab 2269   E.wrex 2544   _Vcvv 2788    i^i cin 3151    C_ wss 3152   (/)c0 3455   ~Pcpw 3625   |^|cint 3862   ` cfv 5255   Fincfn 6863   ficfi 7164
This theorem is referenced by:  fieq0  7174  firest  13337  restbas  16889
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-13 1686  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pow 4188  ax-pr 4214  ax-un 4512
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-pw 3627  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-int 3863  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-iota 5219  df-fun 5257  df-fv 5263  df-fi 7165
  Copyright terms: Public domain W3C validator