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

Theorem ixpprc 8779
Description: A cartesian product of proper-class many sets is empty, because any function in the cartesian product has to be a set with domain 𝐴, which is not possible for a proper class domain. (Contributed by Mario Carneiro, 25-Jan-2015.)
Assertion
Ref Expression
ixpprc 𝐴 ∈ V → X𝑥𝐴 𝐵 = ∅)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem ixpprc
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 neq0 4293 . . 3 X𝑥𝐴 𝐵 = ∅ ↔ ∃𝑓 𝑓X𝑥𝐴 𝐵)
2 ixpfn 8763 . . . . 5 (𝑓X𝑥𝐴 𝐵𝑓 Fn 𝐴)
3 fndm 6589 . . . . . 6 (𝑓 Fn 𝐴 → dom 𝑓 = 𝐴)
4 vex 3445 . . . . . . 7 𝑓 ∈ V
54dmex 7827 . . . . . 6 dom 𝑓 ∈ V
63, 5eqeltrrdi 2846 . . . . 5 (𝑓 Fn 𝐴𝐴 ∈ V)
72, 6syl 17 . . . 4 (𝑓X𝑥𝐴 𝐵𝐴 ∈ V)
87exlimiv 1932 . . 3 (∃𝑓 𝑓X𝑥𝐴 𝐵𝐴 ∈ V)
91, 8sylbi 216 . 2 X𝑥𝐴 𝐵 = ∅ → 𝐴 ∈ V)
109con1i 147 1 𝐴 ∈ V → X𝑥𝐴 𝐵 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1540  wex 1780  wcel 2105  Vcvv 3441  c0 4270  dom cdm 5621   Fn wfn 6475  Xcixp 8757
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2707  ax-sep 5244  ax-nul 5251  ax-pr 5373  ax-un 7651
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-sb 2067  df-clab 2714  df-cleq 2728  df-clel 2814  df-ral 3062  df-rab 3404  df-v 3443  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4271  df-if 4475  df-sn 4575  df-pr 4577  df-op 4581  df-uni 4854  df-br 5094  df-opab 5156  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-iota 6432  df-fun 6482  df-fn 6483  df-fv 6488  df-ixp 8758
This theorem is referenced by:  ixpexg  8782  ixpssmap2g  8787  ixpssmapg  8788  resixpfo  8796
  Copyright terms: Public domain W3C validator