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

Theorem unxpwdom 8129
Description: If a Cartesian product is dominated by a union, then the base set is either weakly dominated by one factor of the union or dominated by the other. Extracted from Lemma 2.3 of [KanamoriPincus] p. 420. (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
unxpwdom  |-  ( ( A  X.  A )  ~<_  ( B  u.  C
)  ->  ( A  ~<_*  B  \/  A  ~<_  C ) )

Proof of Theorem unxpwdom
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 reldom 7600 . . . . 5  |-  Rel  ~<_
21brrelex2i 4894 . . . 4  |-  ( ( A  X.  A )  ~<_  ( B  u.  C
)  ->  ( B  u.  C )  e.  _V )
3 domeng 7608 . . . 4  |-  ( ( B  u.  C )  e.  _V  ->  (
( A  X.  A
)  ~<_  ( B  u.  C )  <->  E. x
( ( A  X.  A )  ~~  x  /\  x  C_  ( B  u.  C ) ) ) )
42, 3syl 17 . . 3  |-  ( ( A  X.  A )  ~<_  ( B  u.  C
)  ->  ( ( A  X.  A )  ~<_  ( B  u.  C )  <->  E. x ( ( A  X.  A )  ~~  x  /\  x  C_  ( B  u.  C )
) ) )
54ibi 249 . 2  |-  ( ( A  X.  A )  ~<_  ( B  u.  C
)  ->  E. x
( ( A  X.  A )  ~~  x  /\  x  C_  ( B  u.  C ) ) )
6 simprl 769 . . . . 5  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( A  X.  A )  ~~  x
)
7 indi 3700 . . . . . 6  |-  ( x  i^i  ( B  u.  C ) )  =  ( ( x  i^i 
B )  u.  (
x  i^i  C )
)
8 simprr 771 . . . . . . 7  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  x  C_  ( B  u.  C )
)
9 df-ss 3429 . . . . . . 7  |-  ( x 
C_  ( B  u.  C )  <->  ( x  i^i  ( B  u.  C
) )  =  x )
108, 9sylib 201 . . . . . 6  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( x  i^i  ( B  u.  C
) )  =  x )
117, 10syl5eqr 2509 . . . . 5  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( ( x  i^i  B )  u.  ( x  i^i  C
) )  =  x )
126, 11breqtrrd 4442 . . . 4  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( A  X.  A )  ~~  (
( x  i^i  B
)  u.  ( x  i^i  C ) ) )
13 unxpwdom2 8128 . . . 4  |-  ( ( A  X.  A ) 
~~  ( ( x  i^i  B )  u.  ( x  i^i  C
) )  ->  ( A  ~<_*  ( x  i^i  B
)  \/  A  ~<_  ( x  i^i  C ) ) )
1412, 13syl 17 . . 3  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( A  ~<_*  (
x  i^i  B )  \/  A  ~<_  ( x  i^i  C ) ) )
15 ssun1 3608 . . . . . . . 8  |-  B  C_  ( B  u.  C
)
162adantr 471 . . . . . . . 8  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( B  u.  C )  e.  _V )
17 ssexg 4562 . . . . . . . 8  |-  ( ( B  C_  ( B  u.  C )  /\  ( B  u.  C )  e.  _V )  ->  B  e.  _V )
1815, 16, 17sylancr 674 . . . . . . 7  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  B  e.  _V )
19 inss2 3664 . . . . . . 7  |-  ( x  i^i  B )  C_  B
20 ssdomg 7640 . . . . . . 7  |-  ( B  e.  _V  ->  (
( x  i^i  B
)  C_  B  ->  ( x  i^i  B )  ~<_  B ) )
2118, 19, 20mpisyl 21 . . . . . 6  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( x  i^i 
B )  ~<_  B )
22 domwdom 8114 . . . . . 6  |-  ( ( x  i^i  B )  ~<_  B  ->  ( x  i^i  B )  ~<_*  B )
2321, 22syl 17 . . . . 5  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( x  i^i 
B )  ~<_*  B )
24 wdomtr 8115 . . . . . 6  |-  ( ( A  ~<_*  ( x  i^i  B
)  /\  ( x  i^i  B )  ~<_*  B )  ->  A  ~<_*  B )
2524expcom 441 . . . . 5  |-  ( ( x  i^i  B )  ~<_*  B  ->  ( A  ~<_*  (
x  i^i  B )  ->  A  ~<_*  B ) )
2623, 25syl 17 . . . 4  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( A  ~<_*  (
x  i^i  B )  ->  A  ~<_*  B ) )
27 ssun2 3609 . . . . . . 7  |-  C  C_  ( B  u.  C
)
28 ssexg 4562 . . . . . . 7  |-  ( ( C  C_  ( B  u.  C )  /\  ( B  u.  C )  e.  _V )  ->  C  e.  _V )
2927, 16, 28sylancr 674 . . . . . 6  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  C  e.  _V )
30 inss2 3664 . . . . . 6  |-  ( x  i^i  C )  C_  C
31 ssdomg 7640 . . . . . 6  |-  ( C  e.  _V  ->  (
( x  i^i  C
)  C_  C  ->  ( x  i^i  C )  ~<_  C ) )
3229, 30, 31mpisyl 21 . . . . 5  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( x  i^i 
C )  ~<_  C )
33 domtr 7647 . . . . . 6  |-  ( ( A  ~<_  ( x  i^i 
C )  /\  (
x  i^i  C )  ~<_  C )  ->  A  ~<_  C )
3433expcom 441 . . . . 5  |-  ( ( x  i^i  C )  ~<_  C  ->  ( A  ~<_  ( x  i^i  C )  ->  A  ~<_  C ) )
3532, 34syl 17 . . . 4  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( A  ~<_  ( x  i^i  C )  ->  A  ~<_  C ) )
3626, 35orim12d 854 . . 3  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( ( A  ~<_*  ( x  i^i  B )  \/  A  ~<_  ( x  i^i  C ) )  ->  ( A  ~<_*  B  \/  A  ~<_  C )
) )
3714, 36mpd 15 . 2  |-  ( ( ( A  X.  A
)  ~<_  ( B  u.  C )  /\  (
( A  X.  A
)  ~~  x  /\  x  C_  ( B  u.  C ) ) )  ->  ( A  ~<_*  B  \/  A  ~<_  C )
)
385, 37exlimddv 1791 1  |-  ( ( A  X.  A )  ~<_  ( B  u.  C
)  ->  ( A  ~<_*  B  \/  A  ~<_  C ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 189    \/ wo 374    /\ wa 375    = wceq 1454   E.wex 1673    e. wcel 1897   _Vcvv 3056    u. cun 3413    i^i cin 3414    C_ wss 3415   class class class wbr 4415    X. cxp 4850    ~~ cen 7591    ~<_ cdom 7592    ~<_* cwdom 8097
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1679  ax-4 1692  ax-5 1768  ax-6 1815  ax-7 1861  ax-8 1899  ax-9 1906  ax-10 1925  ax-11 1930  ax-12 1943  ax-13 2101  ax-ext 2441  ax-sep 4538  ax-nul 4547  ax-pow 4594  ax-pr 4652  ax-un 6609
This theorem depends on definitions:  df-bi 190  df-or 376  df-an 377  df-3an 993  df-tru 1457  df-ex 1674  df-nf 1678  df-sb 1808  df-eu 2313  df-mo 2314  df-clab 2448  df-cleq 2454  df-clel 2457  df-nfc 2591  df-ne 2634  df-ral 2753  df-rex 2754  df-rab 2757  df-v 3058  df-sbc 3279  df-csb 3375  df-dif 3418  df-un 3420  df-in 3422  df-ss 3429  df-nul 3743  df-if 3893  df-pw 3964  df-sn 3980  df-pr 3982  df-op 3986  df-uni 4212  df-int 4248  df-iun 4293  df-br 4416  df-opab 4475  df-mpt 4476  df-id 4767  df-xp 4858  df-rel 4859  df-cnv 4860  df-co 4861  df-dm 4862  df-rn 4863  df-res 4864  df-ima 4865  df-iota 5564  df-fun 5602  df-fn 5603  df-f 5604  df-f1 5605  df-fo 5606  df-f1o 5607  df-fv 5608  df-1st 6819  df-2nd 6820  df-er 7388  df-en 7595  df-dom 7596  df-sdom 7597  df-wdom 8099
This theorem is referenced by:  pwcdadom  8671
  Copyright terms: Public domain W3C validator