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

Theorem fi0 9489
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 5325 . . 3 ∅ ∈ V
2 fival 9481 . . 3 (∅ ∈ V → (fi‘∅) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥})
31, 2ax-mp 5 . 2 (fi‘∅) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥}
4 vprc 5333 . . . 4 ¬ V ∈ V
5 id 22 . . . . . . 7 (𝑦 = 𝑥𝑦 = 𝑥)
6 elinel1 4224 . . . . . . . . . 10 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 ∈ 𝒫 ∅)
7 elpwi 4629 . . . . . . . . . 10 (𝑥 ∈ 𝒫 ∅ → 𝑥 ⊆ ∅)
8 ss0 4425 . . . . . . . . . 10 (𝑥 ⊆ ∅ → 𝑥 = ∅)
96, 7, 83syl 18 . . . . . . . . 9 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = ∅)
109inteqd 4975 . . . . . . . 8 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = ∅)
11 int0 4986 . . . . . . . 8 ∅ = V
1210, 11eqtrdi 2796 . . . . . . 7 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = V)
135, 12sylan9eqr 2802 . . . . . 6 ((𝑥 ∈ (𝒫 ∅ ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = V)
1413rexlimiva 3153 . . . . 5 (∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥𝑦 = V)
15 vex 3492 . . . . 5 𝑦 ∈ V
1614, 15eqeltrrdi 2853 . . . 4 (∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥 → V ∈ V)
174, 16mto 197 . . 3 ¬ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥
1817abf 4429 . 2 {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥} = ∅
193, 18eqtri 2768 1 (fi‘∅) = ∅
Colors of variables: wff setvar class
Syntax hints:   = wceq 1537  wcel 2108  {cab 2717  wrex 3076  Vcvv 3488  cin 3975  wss 3976  c0 4352  𝒫 cpw 4622   cint 4970  cfv 6573  Fincfn 9003  ficfi 9479
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-int 4971  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-fi 9480
This theorem is referenced by:  fieq0  9490  firest  17492  restbas  23187
  Copyright terms: Public domain W3C validator