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

Theorem ixpprc 8838
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 4297 . . 3 X𝑥𝐴 𝐵 = ∅ ↔ ∃𝑓 𝑓X𝑥𝐴 𝐵)
2 ixpfn 8822 . . . . 5 (𝑓X𝑥𝐴 𝐵𝑓 Fn 𝐴)
3 fndm 6579 . . . . . 6 (𝑓 Fn 𝐴 → dom 𝑓 = 𝐴)
4 vex 3440 . . . . . . 7 𝑓 ∈ V
54dmex 7834 . . . . . 6 dom 𝑓 ∈ V
63, 5eqeltrrdi 2840 . . . . 5 (𝑓 Fn 𝐴𝐴 ∈ V)
72, 6syl 17 . . . 4 (𝑓X𝑥𝐴 𝐵𝐴 ∈ V)
87exlimiv 1931 . . 3 (∃𝑓 𝑓X𝑥𝐴 𝐵𝐴 ∈ V)
91, 8sylbi 217 . 2 X𝑥𝐴 𝐵 = ∅ → 𝐴 ∈ V)
109con1i 147 1 𝐴 ∈ V → X𝑥𝐴 𝐵 = ∅)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1541  wex 1780  wcel 2111  Vcvv 3436  c0 4278  dom cdm 5611   Fn wfn 6471  Xcixp 8816
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 2113  ax-9 2121  ax-ext 2703  ax-sep 5229  ax-nul 5239  ax-pr 5365  ax-un 7663
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-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4279  df-if 4471  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4855  df-br 5087  df-opab 5149  df-rel 5618  df-cnv 5619  df-co 5620  df-dm 5621  df-rn 5622  df-iota 6432  df-fun 6478  df-fn 6479  df-fv 6484  df-ixp 8817
This theorem is referenced by:  ixpexg  8841  ixpssmap2g  8846  ixpssmapg  8847  resixpfo  8855
  Copyright terms: Public domain W3C validator