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

Theorem disjor 4164
Description: Two ways to say that a collection  B ( i ) for  i  e.  A is disjoint. (Contributed by Mario Carneiro, 26-Mar-2015.) (Revised by Mario Carneiro, 14-Nov-2016.)
Hypothesis
Ref Expression
disjmo.1  |-  ( i  =  j  ->  B  =  C )
Assertion
Ref Expression
disjor  |-  (Disj  i  e.  A B  <->  A. i  e.  A  A. j  e.  A  ( i  =  j  \/  ( B  i^i  C )  =  (/) ) )
Distinct variable groups:    i, j, A    B, j    C, i
Allowed substitution hints:    B( i)    C( j)

Proof of Theorem disjor
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 df-disj 4151 . 2  |-  (Disj  i  e.  A B  <->  A. x E* i  e.  A x  e.  B )
2 ralcom4 2942 . . 3  |-  ( A. i  e.  A  A. x A. j  e.  A  ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j )  <->  A. x A. i  e.  A  A. j  e.  A  ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
3 orcom 377 . . . . . . 7  |-  ( ( i  =  j  \/  ( B  i^i  C
)  =  (/) )  <->  ( ( B  i^i  C )  =  (/)  \/  i  =  j ) )
4 df-or 360 . . . . . . 7  |-  ( ( ( B  i^i  C
)  =  (/)  \/  i  =  j )  <->  ( -.  ( B  i^i  C )  =  (/)  ->  i  =  j ) )
5 neq0 3606 . . . . . . . . . 10  |-  ( -.  ( B  i^i  C
)  =  (/)  <->  E. x  x  e.  ( B  i^i  C ) )
6 elin 3498 . . . . . . . . . . 11  |-  ( x  e.  ( B  i^i  C )  <->  ( x  e.  B  /\  x  e.  C ) )
76exbii 1589 . . . . . . . . . 10  |-  ( E. x  x  e.  ( B  i^i  C )  <->  E. x ( x  e.  B  /\  x  e.  C ) )
85, 7bitri 241 . . . . . . . . 9  |-  ( -.  ( B  i^i  C
)  =  (/)  <->  E. x
( x  e.  B  /\  x  e.  C
) )
98imbi1i 316 . . . . . . . 8  |-  ( ( -.  ( B  i^i  C )  =  (/)  ->  i  =  j )  <->  ( E. x ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
10 19.23v 1910 . . . . . . . 8  |-  ( A. x ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j )  <->  ( E. x ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
119, 10bitr4i 244 . . . . . . 7  |-  ( ( -.  ( B  i^i  C )  =  (/)  ->  i  =  j )  <->  A. x
( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
123, 4, 113bitri 263 . . . . . 6  |-  ( ( i  =  j  \/  ( B  i^i  C
)  =  (/) )  <->  A. x
( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
1312ralbii 2698 . . . . 5  |-  ( A. j  e.  A  (
i  =  j  \/  ( B  i^i  C
)  =  (/) )  <->  A. j  e.  A  A. x
( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
14 ralcom4 2942 . . . . 5  |-  ( A. j  e.  A  A. x ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j )  <->  A. x A. j  e.  A  ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
1513, 14bitri 241 . . . 4  |-  ( A. j  e.  A  (
i  =  j  \/  ( B  i^i  C
)  =  (/) )  <->  A. x A. j  e.  A  ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
1615ralbii 2698 . . 3  |-  ( A. i  e.  A  A. j  e.  A  (
i  =  j  \/  ( B  i^i  C
)  =  (/) )  <->  A. i  e.  A  A. x A. j  e.  A  ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
17 disjmo.1 . . . . . 6  |-  ( i  =  j  ->  B  =  C )
1817eleq2d 2479 . . . . 5  |-  ( i  =  j  ->  (
x  e.  B  <->  x  e.  C ) )
1918rmo4 3095 . . . 4  |-  ( E* i  e.  A x  e.  B  <->  A. i  e.  A  A. j  e.  A  ( (
x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
2019albii 1572 . . 3  |-  ( A. x E* i  e.  A x  e.  B  <->  A. x A. i  e.  A  A. j  e.  A  ( ( x  e.  B  /\  x  e.  C )  ->  i  =  j ) )
212, 16, 203bitr4i 269 . 2  |-  ( A. i  e.  A  A. j  e.  A  (
i  =  j  \/  ( B  i^i  C
)  =  (/) )  <->  A. x E* i  e.  A x  e.  B )
221, 21bitr4i 244 1  |-  (Disj  i  e.  A B  <->  A. i  e.  A  A. j  e.  A  ( i  =  j  \/  ( B  i^i  C )  =  (/) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    \/ wo 358    /\ wa 359   A.wal 1546   E.wex 1547    = wceq 1649    e. wcel 1721   A.wral 2674   E*wrmo 2677    i^i cin 3287   (/)c0 3596  Disj wdisj 4150
This theorem is referenced by:  disjmoOLD  4165  disjors  4166  disjxiun  4177  disjxun  4178  qsdisj2  6949  dyadmbl  19453  disjorsf  23983  mblfinlem  26151  otsndisj  27961  otiunsndisj  27962  otiunsndisjX  27963  2spotdisj  28172  2spotiundisj  28173  2spotmdisj  28179
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2393
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2266  df-mo 2267  df-clab 2399  df-cleq 2405  df-clel 2408  df-nfc 2537  df-ne 2577  df-ral 2679  df-rmo 2682  df-v 2926  df-dif 3291  df-in 3295  df-nul 3597  df-disj 4151
  Copyright terms: Public domain W3C validator