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

Theorem ixp0x 8923
Description: An infinite Cartesian product with an empty index set. (Contributed by NM, 21-Sep-2007.)
Assertion
Ref Expression
ixp0x X𝑥 ∈ ∅ 𝐴 = {∅}

Proof of Theorem ixp0x
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 dfixp 8896 . 2 X𝑥 ∈ ∅ 𝐴 = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
2 velsn 4610 . . . 4 (𝑓 ∈ {∅} ↔ 𝑓 = ∅)
3 fn0 6667 . . . 4 (𝑓 Fn ∅ ↔ 𝑓 = ∅)
4 ral0 4464 . . . . 5 𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴
54biantru 538 . . . 4 (𝑓 Fn ∅ ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
62, 3, 53bitr2i 302 . . 3 (𝑓 ∈ {∅} ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
76eqabi 2904 . 2 {∅} = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
81, 7eqtr4i 2795 1 X𝑥 ∈ ∅ 𝐴 = {∅}
Colors of variables: wff setvar class
Syntax hints:  wa 400   = wceq 1567  wcel 2149  {cab 2747  wral 3085  c0 4294  {csn 4594   Fn wfn 6532  cfv 6537  Xcixp 8894
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-mo 2573  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5114  df-opab 5178  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-fun 6539  df-fn 6540  df-ixp 8895
This theorem is referenced by:  0elixp  8926  ptcmpfi  23938  finixpnum  38143  ioorrnopn  46910  ioorrnopnxr  46912  hoicvr  47153  ovnhoi  47208  ovnlecvr2  47215  hoiqssbl  47230  hoimbl  47236  iunhoiioo  47281
  Copyright terms: Public domain W3C validator