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

Theorem fi0 8868
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 5175 . . 3 ∅ ∈ V
2 fival 8860 . . 3 (∅ ∈ V → (fi‘∅) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥})
31, 2ax-mp 5 . 2 (fi‘∅) = {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥}
4 vprc 5183 . . . 4 ¬ V ∈ V
5 id 22 . . . . . . 7 (𝑦 = 𝑥𝑦 = 𝑥)
6 elinel1 4122 . . . . . . . . . 10 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 ∈ 𝒫 ∅)
7 elpwi 4506 . . . . . . . . . 10 (𝑥 ∈ 𝒫 ∅ → 𝑥 ⊆ ∅)
8 ss0 4306 . . . . . . . . . 10 (𝑥 ⊆ ∅ → 𝑥 = ∅)
96, 7, 83syl 18 . . . . . . . . 9 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = ∅)
109inteqd 4843 . . . . . . . 8 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = ∅)
11 int0 4852 . . . . . . . 8 ∅ = V
1210, 11eqtrdi 2849 . . . . . . 7 (𝑥 ∈ (𝒫 ∅ ∩ Fin) → 𝑥 = V)
135, 12sylan9eqr 2855 . . . . . 6 ((𝑥 ∈ (𝒫 ∅ ∩ Fin) ∧ 𝑦 = 𝑥) → 𝑦 = V)
1413rexlimiva 3240 . . . . 5 (∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥𝑦 = V)
15 vex 3444 . . . . 5 𝑦 ∈ V
1614, 15eqeltrrdi 2899 . . . 4 (∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥 → V ∈ V)
174, 16mto 200 . . 3 ¬ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥
1817abf 4310 . 2 {𝑦 ∣ ∃𝑥 ∈ (𝒫 ∅ ∩ Fin)𝑦 = 𝑥} = ∅
193, 18eqtri 2821 1 (fi‘∅) = ∅
Colors of variables: wff setvar class
Syntax hints:   = wceq 1538  wcel 2111  {cab 2776  wrex 3107  Vcvv 3441  cin 3880  wss 3881  c0 4243  𝒫 cpw 4497   cint 4838  cfv 6324  Fincfn 8492  ficfi 8858
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-int 4839  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-iota 6283  df-fun 6326  df-fv 6332  df-fi 8859
This theorem is referenced by:  fieq0  8869  firest  16698  restbas  21763
  Copyright terms: Public domain W3C validator