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

Theorem ixpprc 7075
 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
Distinct variable group:   ,
Allowed substitution hint:   ()

Proof of Theorem ixpprc
Dummy variable is distinct from all other variables.
StepHypRef Expression
1 neq0 3630 . . 3
2 ixpfn 7060 . . . . 5
3 fndm 5536 . . . . . 6
4 vex 2951 . . . . . . 7
54dmex 5124 . . . . . 6
63, 5syl6eqelr 2524 . . . . 5
72, 6syl 16 . . . 4
87exlimiv 1644 . . 3
91, 8sylbi 188 . 2
109con1i 123 1
 Colors of variables: wff set class Syntax hints:   wn 3   wi 4  wex 1550   wceq 1652   wcel 1725  cvv 2948  c0 3620   cdm 4870   wfn 5441  cixp 7055 This theorem is referenced by:  ixpexg  7078  ixpssmap2g  7083  ixpssmapg  7084  resixpfo  7092 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-sep 4322  ax-nul 4330  ax-pr 4395  ax-un 4693 This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-rab 2706  df-v 2950  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-nul 3621  df-if 3732  df-sn 3812  df-pr 3813  df-op 3815  df-uni 4008  df-br 4205  df-opab 4259  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-iota 5410  df-fun 5448  df-fn 5449  df-fv 5454  df-ixp 7056
 Copyright terms: Public domain W3C validator