Users' Mathboxes Mathbox for Stefan O'Rear < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  wdom2d2 Structured version   Unicode version

Theorem wdom2d2 29384
Description: Deduction for weak dominance by a Cartesian product. MOVABLE (Contributed by Stefan O'Rear, 10-Jul-2015.)
Hypotheses
Ref Expression
wdom2d2.a  |-  ( ph  ->  A  e.  V )
wdom2d2.b  |-  ( ph  ->  B  e.  W )
wdom2d2.c  |-  ( ph  ->  C  e.  X )
wdom2d2.o  |-  ( (
ph  /\  x  e.  A )  ->  E. y  e.  B  E. z  e.  C  x  =  X )
Assertion
Ref Expression
wdom2d2  |-  ( ph  ->  A  ~<_*  ( B  X.  C
) )
Distinct variable groups:    x, y,
z    x, X    x, A    x, B, y    x, C, y, z    ph, x
Allowed substitution hints:    ph( y, z)    A( y, z)    B( z)    V( x, y, z)    W( x, y, z)    X( y, z)

Proof of Theorem wdom2d2
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 wdom2d2.a . 2  |-  ( ph  ->  A  e.  V )
2 wdom2d2.b . . 3  |-  ( ph  ->  B  e.  W )
3 wdom2d2.c . . 3  |-  ( ph  ->  C  e.  X )
4 xpexg 6507 . . 3  |-  ( ( B  e.  W  /\  C  e.  X )  ->  ( B  X.  C
)  e.  _V )
52, 3, 4syl2anc 661 . 2  |-  ( ph  ->  ( B  X.  C
)  e.  _V )
6 wdom2d2.o . . 3  |-  ( (
ph  /\  x  e.  A )  ->  E. y  e.  B  E. z  e.  C  x  =  X )
7 nfcsb1v 3304 . . . . 5  |-  F/_ y [_ ( 1st `  w
)  /  y ]_ [_ ( 2nd `  w
)  /  z ]_ X
87nfeq2 2590 . . . 4  |-  F/ y  x  =  [_ ( 1st `  w )  / 
y ]_ [_ ( 2nd `  w )  /  z ]_ X
9 nfcv 2579 . . . . . 6  |-  F/_ z
( 1st `  w
)
10 nfcsb1v 3304 . . . . . 6  |-  F/_ z [_ ( 2nd `  w
)  /  z ]_ X
119, 10nfcsb 3306 . . . . 5  |-  F/_ z [_ ( 1st `  w
)  /  y ]_ [_ ( 2nd `  w
)  /  z ]_ X
1211nfeq2 2590 . . . 4  |-  F/ z  x  =  [_ ( 1st `  w )  / 
y ]_ [_ ( 2nd `  w )  /  z ]_ X
13 nfv 1673 . . . 4  |-  F/ w  x  =  X
14 csbopeq1a 6627 . . . . 5  |-  ( w  =  <. y ,  z
>.  ->  [_ ( 1st `  w
)  /  y ]_ [_ ( 2nd `  w
)  /  z ]_ X  =  X )
1514eqeq2d 2454 . . . 4  |-  ( w  =  <. y ,  z
>.  ->  ( x  = 
[_ ( 1st `  w
)  /  y ]_ [_ ( 2nd `  w
)  /  z ]_ X 
<->  x  =  X ) )
168, 12, 13, 15rexxpf 4987 . . 3  |-  ( E. w  e.  ( B  X.  C ) x  =  [_ ( 1st `  w )  /  y ]_ [_ ( 2nd `  w
)  /  z ]_ X 
<->  E. y  e.  B  E. z  e.  C  x  =  X )
176, 16sylibr 212 . 2  |-  ( (
ph  /\  x  e.  A )  ->  E. w  e.  ( B  X.  C
) x  =  [_ ( 1st `  w )  /  y ]_ [_ ( 2nd `  w )  / 
z ]_ X )
181, 5, 17wdom2d 7795 1  |-  ( ph  ->  A  ~<_*  ( B  X.  C
) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 369    = wceq 1369    e. wcel 1756   E.wrex 2716   _Vcvv 2972   [_csb 3288   <.cop 3883   class class class wbr 4292    X. cxp 4838   ` cfv 5418   1stc1st 6575   2ndc2nd 6576    ~<_* cwdom 7772
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-sep 4413  ax-nul 4421  ax-pow 4470  ax-pr 4531  ax-un 6372
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1372  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2568  df-ne 2608  df-ral 2720  df-rex 2721  df-rab 2724  df-v 2974  df-sbc 3187  df-csb 3289  df-dif 3331  df-un 3333  df-in 3335  df-ss 3342  df-nul 3638  df-if 3792  df-pw 3862  df-sn 3878  df-pr 3880  df-op 3884  df-uni 4092  df-iun 4173  df-br 4293  df-opab 4351  df-mpt 4352  df-id 4636  df-xp 4846  df-rel 4847  df-cnv 4848  df-co 4849  df-dm 4850  df-rn 4851  df-res 4852  df-ima 4853  df-iota 5381  df-fun 5420  df-fn 5421  df-f 5422  df-f1 5423  df-fo 5424  df-f1o 5425  df-fv 5426  df-1st 6577  df-2nd 6578  df-er 7101  df-en 7311  df-dom 7312  df-sdom 7313  df-wdom 7774
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator