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

Theorem fi0 9330
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 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 5236 . . 3 ∅ ∈ V
2 fival 9322 . . 3 (∅ ∈ V → (fi‘∅) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥})
31, 2ax-mp 5 . 2 (fi‘∅) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥}
4 vprc 5249 . . . 4 ¬ V ∈ V
5 id 22 . . . . . . 7 (𝑦 = 𝑥𝑦 = 𝑥)
6 elinel1 4137 . . . . . . . . . 10 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 ∈ 𝒫 ∅)
7 elpwi 4543 . . . . . . . . . 10 (𝑥 ∈ 𝒫 ∅ → 𝑥 ⊆ ∅)
8 ss0 4337 . . . . . . . . . 10 (𝑥 ⊆ ∅ → 𝑥 = ∅)
96, 7, 83syl 18 . . . . . . . . 9 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = ∅)
109inteqd 4889 . . . . . . . 8 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = ∅)
11 int0 4899 . . . . . . . 8 ∅ = V
1210, 11eqtrdi 2791 . . . . . . 7 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = V)
135, 12sylan9eqr 2797 . . . . . 6 ((𝑥 ∈ (𝒫 ∅ ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = V)
1413rexlimiva 3133 . . . . 5 (∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥𝑦 = V)
15 vex 3436 . . . . 5 𝑦 ∈ V
1614, 15eqeltrrdi 2849 . . . 4 (∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥 → V ∈ V)
174, 16mto 198 . . 3 ¬ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥
1817abf 4341 . 2 {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥} = ∅
193, 18eqtri 2763 1 (fi‘∅) = ∅
Colors of variables: wff setvar class
Syntax hints:   = wceq 1547  wcel 2119  {cab 2718  wrex 3064  Vcvv 3432  cin 3889  wss 3890  c0 4268  𝒫 cpw 4536   cint 4884  cfv 6492  Fincfn 8890  ficfi 9320
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-iota 6448  df-fun 6494  df-fv 6500  df-fi 9321
This theorem is referenced by:  fieq0  9331  firest  17393  restbas  23148
  Copyright terms: Public domain W3C validator