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

Theorem disji2 4051
Description: Property of a disjoint collection: if  B ( X )  =  C and  B ( Y )  =  D, and  X  =/=  Y, then  C and  D are disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)
Hypotheses
Ref Expression
disji.1  |-  ( x  =  X  ->  B  =  C )
disji.2  |-  ( x  =  Y  ->  B  =  D )
Assertion
Ref Expression
disji2  |-  ( (Disj  x  e.  A  B  /\  ( X  e.  A  /\  Y  e.  A
)  /\  X  =/=  Y )  ->  ( C  i^i  D )  =  (/) )
Distinct variable groups:    x, A    x, C    x, D    x, X    x, Y
Allowed substitution hint:    B( x)

Proof of Theorem disji2
Dummy variables  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 disjnims 4050 . . 3  |-  (Disj  x  e.  A  B  ->  A. y  e.  A  A. z  e.  A  (
y  =/=  z  -> 
( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  (/) ) )
2 neeq1 2391 . . . . 5  |-  ( y  =  X  ->  (
y  =/=  z  <->  X  =/=  z ) )
3 nfcv 2350 . . . . . . . 8  |-  F/_ x X
4 nfcv 2350 . . . . . . . 8  |-  F/_ x C
5 disji.1 . . . . . . . 8  |-  ( x  =  X  ->  B  =  C )
63, 4, 5csbhypf 3140 . . . . . . 7  |-  ( y  =  X  ->  [_ y  /  x ]_ B  =  C )
76ineq1d 3381 . . . . . 6  |-  ( y  =  X  ->  ( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  ( C  i^i  [_ z  /  x ]_ B ) )
87eqeq1d 2216 . . . . 5  |-  ( y  =  X  ->  (
( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  (/)  <->  ( C  i^i  [_ z  /  x ]_ B )  =  (/) ) )
92, 8imbi12d 234 . . . 4  |-  ( y  =  X  ->  (
( y  =/=  z  ->  ( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  (/) )  <->  ( X  =/=  z  ->  ( C  i^i  [_ z  /  x ]_ B )  =  (/) ) ) )
10 neeq2 2392 . . . . 5  |-  ( z  =  Y  ->  ( X  =/=  z  <->  X  =/=  Y ) )
11 nfcv 2350 . . . . . . . 8  |-  F/_ x Y
12 nfcv 2350 . . . . . . . 8  |-  F/_ x D
13 disji.2 . . . . . . . 8  |-  ( x  =  Y  ->  B  =  D )
1411, 12, 13csbhypf 3140 . . . . . . 7  |-  ( z  =  Y  ->  [_ z  /  x ]_ B  =  D )
1514ineq2d 3382 . . . . . 6  |-  ( z  =  Y  ->  ( C  i^i  [_ z  /  x ]_ B )  =  ( C  i^i  D ) )
1615eqeq1d 2216 . . . . 5  |-  ( z  =  Y  ->  (
( C  i^i  [_ z  /  x ]_ B )  =  (/)  <->  ( C  i^i  D )  =  (/) ) )
1710, 16imbi12d 234 . . . 4  |-  ( z  =  Y  ->  (
( X  =/=  z  ->  ( C  i^i  [_ z  /  x ]_ B )  =  (/) )  <->  ( X  =/=  Y  ->  ( C  i^i  D )  =  (/) ) ) )
189, 17rspc2v 2897 . . 3  |-  ( ( X  e.  A  /\  Y  e.  A )  ->  ( A. y  e.  A  A. z  e.  A  ( y  =/=  z  ->  ( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  (/) )  ->  ( X  =/= 
Y  ->  ( C  i^i  D )  =  (/) ) ) )
191, 18mpan9 281 . 2  |-  ( (Disj  x  e.  A  B  /\  ( X  e.  A  /\  Y  e.  A
) )  ->  ( X  =/=  Y  ->  ( C  i^i  D )  =  (/) ) )
20193impia 1203 1  |-  ( (Disj  x  e.  A  B  /\  ( X  e.  A  /\  Y  e.  A
)  /\  X  =/=  Y )  ->  ( C  i^i  D )  =  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 981    = wceq 1373    e. wcel 2178    =/= wne 2378   A.wral 2486   [_csb 3101    i^i cin 3173   (/)c0 3468  Disj wdisj 4035
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-in1 615  ax-in2 616  ax-io 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2189
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1485  df-sb 1787  df-eu 2058  df-mo 2059  df-clab 2194  df-cleq 2200  df-clel 2203  df-nfc 2339  df-ne 2379  df-ral 2491  df-rex 2492  df-reu 2493  df-rmo 2494  df-v 2778  df-sbc 3006  df-csb 3102  df-dif 3176  df-in 3180  df-nul 3469  df-disj 4036
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator