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

Theorem ixpprc 8707
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 4279 . . 3 X𝑥𝐴 𝐵 = ∅ ↔ ∃𝑓 𝑓X𝑥𝐴 𝐵)
2 ixpfn 8691 . . . . 5 (𝑓X𝑥𝐴 𝐵𝑓 Fn 𝐴)
3 fndm 6536 . . . . . 6 (𝑓 Fn 𝐴 → dom 𝑓 = 𝐴)
4 vex 3436 . . . . . . 7 𝑓 ∈ V
54dmex 7758 . . . . . 6 dom 𝑓 ∈ V
63, 5eqeltrrdi 2848 . . . . 5 (𝑓 Fn 𝐴𝐴 ∈ V)
72, 6syl 17 . . . 4 (𝑓X𝑥𝐴 𝐵𝐴 ∈ V)
87exlimiv 1933 . . 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 1539  wex 1782  wcel 2106  Vcvv 3432  c0 4256  dom cdm 5589   Fn wfn 6428  Xcixp 8685
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-fv 6441  df-ixp 8686
This theorem is referenced by:  ixpexg  8710  ixpssmap2g  8715  ixpssmapg  8716  resixpfo  8724
  Copyright terms: Public domain W3C validator