ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  disjxp1 Unicode version

Theorem disjxp1 6462
Description: The sets of a cartesian product are disjoint if the sets in the first argument are disjoint. (Contributed by Glauco Siliprandi, 11-Oct-2020.)
Hypothesis
Ref Expression
disjxp1.1  |-  ( ph  -> Disj  x  e.  A  B
)
Assertion
Ref Expression
disjxp1  |-  ( ph  -> Disj  x  e.  A  ( B  X.  C ) )
Distinct variable groups:    x, A    ph, x
Allowed substitution hints:    B( x)    C( x)

Proof of Theorem disjxp1
Dummy variables  y  z  w are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xp1st 6389 . . . . . . 7  |-  ( y  e.  ( B  X.  C )  ->  ( 1st `  y )  e.  B )
2 xp1st 6389 . . . . . . 7  |-  ( y  e.  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C )  ->  ( 1st `  y )  e. 
[_ w  /  x ]_ B )
3 disjxp1.1 . . . . . . . . . . . 12  |-  ( ph  -> Disj  x  e.  A  B
)
4 df-disj 4102 . . . . . . . . . . . 12  |-  (Disj  x  e.  A  B  <->  A. z E* x  e.  A  z  e.  B )
53, 4sylib 122 . . . . . . . . . . 11  |-  ( ph  ->  A. z E* x  e.  A  z  e.  B )
6 1stexg 6391 . . . . . . . . . . . . 13  |-  ( y  e.  _V  ->  ( 1st `  y )  e. 
_V )
76elv 2825 . . . . . . . . . . . 12  |-  ( 1st `  y )  e.  _V
8 eleq1 2301 . . . . . . . . . . . . 13  |-  ( z  =  ( 1st `  y
)  ->  ( z  e.  B  <->  ( 1st `  y
)  e.  B ) )
98rmobidv 2742 . . . . . . . . . . . 12  |-  ( z  =  ( 1st `  y
)  ->  ( E* x  e.  A  z  e.  B  <->  E* x  e.  A  ( 1st `  y )  e.  B ) )
107, 9spcv 2919 . . . . . . . . . . 11  |-  ( A. z E* x  e.  A  z  e.  B  ->  E* x  e.  A  ( 1st `  y )  e.  B )
115, 10syl 14 . . . . . . . . . 10  |-  ( ph  ->  E* x  e.  A  ( 1st `  y )  e.  B )
12 nfcv 2392 . . . . . . . . . . 11  |-  F/_ x A
13 nfcv 2392 . . . . . . . . . . 11  |-  F/_ w A
14 nfcsb1v 3180 . . . . . . . . . . . 12  |-  F/_ x [_ w  /  x ]_ B
1514nfel2 2405 . . . . . . . . . . 11  |-  F/ x
( 1st `  y
)  e.  [_ w  /  x ]_ B
16 csbeq1a 3156 . . . . . . . . . . . 12  |-  ( x  =  w  ->  B  =  [_ w  /  x ]_ B )
1716eleq2d 2308 . . . . . . . . . . 11  |-  ( x  =  w  ->  (
( 1st `  y
)  e.  B  <->  ( 1st `  y )  e.  [_ w  /  x ]_ B
) )
1812, 13, 15, 17rmo4f 3024 . . . . . . . . . 10  |-  ( E* x  e.  A  ( 1st `  y )  e.  B  <->  A. x  e.  A  A. w  e.  A  ( (
( 1st `  y
)  e.  B  /\  ( 1st `  y )  e.  [_ w  /  x ]_ B )  ->  x  =  w )
)
1911, 18sylib 122 . . . . . . . . 9  |-  ( ph  ->  A. x  e.  A  A. w  e.  A  ( ( ( 1st `  y )  e.  B  /\  ( 1st `  y
)  e.  [_ w  /  x ]_ B )  ->  x  =  w ) )
2019r19.21bi 2638 . . . . . . . 8  |-  ( (
ph  /\  x  e.  A )  ->  A. w  e.  A  ( (
( 1st `  y
)  e.  B  /\  ( 1st `  y )  e.  [_ w  /  x ]_ B )  ->  x  =  w )
)
2120r19.21bi 2638 . . . . . . 7  |-  ( ( ( ph  /\  x  e.  A )  /\  w  e.  A )  ->  (
( ( 1st `  y
)  e.  B  /\  ( 1st `  y )  e.  [_ w  /  x ]_ B )  ->  x  =  w )
)
221, 2, 21syl2ani 412 . . . . . 6  |-  ( ( ( ph  /\  x  e.  A )  /\  w  e.  A )  ->  (
( y  e.  ( B  X.  C )  /\  y  e.  (
[_ w  /  x ]_ B  X.  [_ w  /  x ]_ C ) )  ->  x  =  w ) )
2322ralrimiva 2623 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  A. w  e.  A  ( (
y  e.  ( B  X.  C )  /\  y  e.  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C ) )  ->  x  =  w )
)
2423ralrimiva 2623 . . . 4  |-  ( ph  ->  A. x  e.  A  A. w  e.  A  ( ( y  e.  ( B  X.  C
)  /\  y  e.  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C ) )  ->  x  =  w ) )
25 nfcsb1v 3180 . . . . . . 7  |-  F/_ x [_ w  /  x ]_ C
2614, 25nfxp 4796 . . . . . 6  |-  F/_ x
( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C )
2726nfel2 2405 . . . . 5  |-  F/ x  y  e.  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C )
28 csbeq1a 3156 . . . . . . 7  |-  ( x  =  w  ->  C  =  [_ w  /  x ]_ C )
2916, 28xpeq12d 4794 . . . . . 6  |-  ( x  =  w  ->  ( B  X.  C )  =  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C
) )
3029eleq2d 2308 . . . . 5  |-  ( x  =  w  ->  (
y  e.  ( B  X.  C )  <->  y  e.  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C ) ) )
3112, 13, 27, 30rmo4f 3024 . . . 4  |-  ( E* x  e.  A  y  e.  ( B  X.  C )  <->  A. x  e.  A  A. w  e.  A  ( (
y  e.  ( B  X.  C )  /\  y  e.  ( [_ w  /  x ]_ B  X.  [_ w  /  x ]_ C ) )  ->  x  =  w )
)
3224, 31sylibr 134 . . 3  |-  ( ph  ->  E* x  e.  A  y  e.  ( B  X.  C ) )
3332alrimiv 1927 . 2  |-  ( ph  ->  A. y E* x  e.  A  y  e.  ( B  X.  C
) )
34 df-disj 4102 . 2  |-  (Disj  x  e.  A  ( B  X.  C )  <->  A. y E* x  e.  A  y  e.  ( B  X.  C ) )
3533, 34sylibr 134 1  |-  ( ph  -> Disj  x  e.  A  ( B  X.  C ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104   A.wal 1400    = wceq 1402    e. wcel 2209   A.wral 2528   E*wrmo 2531   _Vcvv 2821   [_csb 3147  Disj wdisj 4101    X. cxp 4767   ` cfv 5372   1stc1st 6362
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rmo 2536  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-disj 4102  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-fo 5378  df-fv 5380  df-1st 6364
This theorem is referenced by:  disjsnxp  6463
  Copyright terms: Public domain W3C validator