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

Theorem ixp0x 8867
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 8840 . 2 X𝑥 ∈ ∅ 𝐴 = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
2 velsn 4584 . . . 4 (𝑓 ∈ {∅} ↔ 𝑓 = ∅)
3 fn0 6623 . . . 4 (𝑓 Fn ∅ ↔ 𝑓 = ∅)
4 ral0 4439 . . . . 5 𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴
54biantru 529 . . . 4 (𝑓 Fn ∅ ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
62, 3, 53bitr2i 299 . . 3 (𝑓 ∈ {∅} ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
76eqabi 2872 . 2 {∅} = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
81, 7eqtr4i 2763 1 X𝑥 ∈ ∅ 𝐴 = {∅}
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1542  wcel 2114  {cab 2715  wral 3052  c0 4274  {csn 4568   Fn wfn 6487  cfv 6492  Xcixp 8838
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-fun 6494  df-fn 6495  df-ixp 8839
This theorem is referenced by:  0elixp  8870  ptcmpfi  23788  finixpnum  37940  ioorrnopn  46751  ioorrnopnxr  46753  hoicvr  46994  ovnhoi  47049  ovnlecvr2  47056  hoiqssbl  47071  hoimbl  47077  iunhoiioo  47122
  Copyright terms: Public domain W3C validator