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

Theorem ixp0x 8859
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 8832 . 2 X𝑥 ∈ ∅ 𝐴 = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
2 velsn 4593 . . . 4 (𝑓 ∈ {∅} ↔ 𝑓 = ∅)
3 fn0 6620 . . . 4 (𝑓 Fn ∅ ↔ 𝑓 = ∅)
4 ral0 4464 . . . . 5 𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴
54biantru 529 . . . 4 (𝑓 Fn ∅ ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
62, 3, 53bitr2i 299 . . 3 (𝑓 ∈ {∅} ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
76eqabi 2868 . 2 {∅} = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
81, 7eqtr4i 2759 1 X𝑥 ∈ ∅ 𝐴 = {∅}
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  wcel 2113  {cab 2711  wral 3049  c0 4284  {csn 4577   Fn wfn 6484  cfv 6489  Xcixp 8830
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pr 5374
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-mo 2537  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4285  df-if 4477  df-sn 4578  df-pr 4580  df-op 4584  df-br 5096  df-opab 5158  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-fun 6491  df-fn 6492  df-ixp 8831
This theorem is referenced by:  0elixp  8862  ptcmpfi  23738  finixpnum  37655  ioorrnopn  46417  ioorrnopnxr  46419  hoicvr  46660  ovnhoi  46715  ovnlecvr2  46722  hoiqssbl  46737  hoimbl  46743  iunhoiioo  46788
  Copyright terms: Public domain W3C validator