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

Theorem disji2 3958
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 3957 . . 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 2340 . . . . 5  |-  ( y  =  X  ->  (
y  =/=  z  <->  X  =/=  z ) )
3 nfcv 2299 . . . . . . . 8  |-  F/_ x X
4 nfcv 2299 . . . . . . . 8  |-  F/_ x C
5 disji.1 . . . . . . . 8  |-  ( x  =  X  ->  B  =  C )
63, 4, 5csbhypf 3069 . . . . . . 7  |-  ( y  =  X  ->  [_ y  /  x ]_ B  =  C )
76ineq1d 3307 . . . . . 6  |-  ( y  =  X  ->  ( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  ( C  i^i  [_ z  /  x ]_ B ) )
87eqeq1d 2166 . . . . 5  |-  ( y  =  X  ->  (
( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  (/)  <->  ( C  i^i  [_ z  /  x ]_ B )  =  (/) ) )
92, 8imbi12d 233 . . . 4  |-  ( y  =  X  ->  (
( y  =/=  z  ->  ( [_ y  /  x ]_ B  i^i  [_ z  /  x ]_ B )  =  (/) )  <->  ( X  =/=  z  ->  ( C  i^i  [_ z  /  x ]_ B )  =  (/) ) ) )
10 neeq2 2341 . . . . 5  |-  ( z  =  Y  ->  ( X  =/=  z  <->  X  =/=  Y ) )
11 nfcv 2299 . . . . . . . 8  |-  F/_ x Y
12 nfcv 2299 . . . . . . . 8  |-  F/_ x D
13 disji.2 . . . . . . . 8  |-  ( x  =  Y  ->  B  =  D )
1411, 12, 13csbhypf 3069 . . . . . . 7  |-  ( z  =  Y  ->  [_ z  /  x ]_ B  =  D )
1514ineq2d 3308 . . . . . 6  |-  ( z  =  Y  ->  ( C  i^i  [_ z  /  x ]_ B )  =  ( C  i^i  D ) )
1615eqeq1d 2166 . . . . 5  |-  ( z  =  Y  ->  (
( C  i^i  [_ z  /  x ]_ B )  =  (/)  <->  ( C  i^i  D )  =  (/) ) )
1710, 16imbi12d 233 . . . 4  |-  ( z  =  Y  ->  (
( X  =/=  z  ->  ( C  i^i  [_ z  /  x ]_ B )  =  (/) )  <->  ( X  =/=  Y  ->  ( C  i^i  D )  =  (/) ) ) )
189, 17rspc2v 2829 . . 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 279 . 2  |-  ( (Disj  x  e.  A  B  /\  ( X  e.  A  /\  Y  e.  A
) )  ->  ( X  =/=  Y  ->  ( C  i^i  D )  =  (/) ) )
20193impia 1182 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 103    /\ w3a 963    = wceq 1335    e. wcel 2128    =/= wne 2327   A.wral 2435   [_csb 3031    i^i cin 3101   (/)c0 3394  Disj wdisj 3942
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-reu 2442  df-rmo 2443  df-v 2714  df-sbc 2938  df-csb 3032  df-dif 3104  df-in 3108  df-nul 3395  df-disj 3943
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator