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

Theorem ixp0x 8920
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 8893 . 2 X𝑥 ∈ ∅ 𝐴 = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
2 velsn 4605 . . . 4 (𝑓 ∈ {∅} ↔ 𝑓 = ∅)
3 fn0 6666 . . . 4 (𝑓 Fn ∅ ↔ 𝑓 = ∅)
4 ral0 4459 . . . . 5 𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴
54biantru 538 . . . 4 (𝑓 Fn ∅ ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
62, 3, 53bitr2i 302 . . 3 (𝑓 ∈ {∅} ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴))
76eqabi 2898 . 2 {∅} = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓𝑥) ∈ 𝐴)}
81, 7eqtr4i 2789 1 X𝑥 ∈ ∅ 𝐴 = {∅}
Colors of variables: wff setvar class
Syntax hints:  wa 400   = wceq 1570  wcel 2143  {cab 2741  wral 3079  c0 4286  {csn 4589   Fn wfn 6531  cfv 6536  Xcixp 8891
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-fun 6538  df-fn 6539  df-ixp 8892
This theorem is referenced by:  0elixp  8923  ptcmpfi  23970  finixpnum  38256  ioorrnopn  47019  ioorrnopnxr  47021  hoicvr  47262  ovnhoi  47317  ovnlecvr2  47324  hoiqssbl  47339  hoimbl  47345  iunhoiioo  47390
  Copyright terms: Public domain W3C validator