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

Theorem invdisj 3923
Description: If there is a function  C (
y ) such that  C (
y )  =  x for all  y  e.  B
( x ), then the sets  B ( x ) for distinct  x  e.  A are disjoint. (Contributed by Mario Carneiro, 10-Dec-2016.)
Assertion
Ref Expression
invdisj  |-  ( A. x  e.  A  A. y  e.  B  C  =  x  -> Disj  x  e.  A  B )
Distinct variable groups:    x, y    y, A    y, B    x, C
Allowed substitution hints:    A( x)    B( x)    C( y)

Proof of Theorem invdisj
StepHypRef Expression
1 nfra2xy 2475 . . 3  |-  F/ y A. x  e.  A  A. y  e.  B  C  =  x
2 df-ral 2421 . . . . 5  |-  ( A. x  e.  A  A. y  e.  B  C  =  x  <->  A. x ( x  e.  A  ->  A. y  e.  B  C  =  x ) )
3 rsp 2480 . . . . . . . . 9  |-  ( A. y  e.  B  C  =  x  ->  ( y  e.  B  ->  C  =  x ) )
4 eqcom 2141 . . . . . . . . 9  |-  ( C  =  x  <->  x  =  C )
53, 4syl6ib 160 . . . . . . . 8  |-  ( A. y  e.  B  C  =  x  ->  ( y  e.  B  ->  x  =  C ) )
65imim2i 12 . . . . . . 7  |-  ( ( x  e.  A  ->  A. y  e.  B  C  =  x )  ->  ( x  e.  A  ->  ( y  e.  B  ->  x  =  C ) ) )
76impd 252 . . . . . 6  |-  ( ( x  e.  A  ->  A. y  e.  B  C  =  x )  ->  ( ( x  e.  A  /\  y  e.  B )  ->  x  =  C ) )
87alimi 1431 . . . . 5  |-  ( A. x ( x  e.  A  ->  A. y  e.  B  C  =  x )  ->  A. x
( ( x  e.  A  /\  y  e.  B )  ->  x  =  C ) )
92, 8sylbi 120 . . . 4  |-  ( A. x  e.  A  A. y  e.  B  C  =  x  ->  A. x
( ( x  e.  A  /\  y  e.  B )  ->  x  =  C ) )
10 mo2icl 2863 . . . 4  |-  ( A. x ( ( x  e.  A  /\  y  e.  B )  ->  x  =  C )  ->  E* x ( x  e.  A  /\  y  e.  B ) )
119, 10syl 14 . . 3  |-  ( A. x  e.  A  A. y  e.  B  C  =  x  ->  E* x
( x  e.  A  /\  y  e.  B
) )
121, 11alrimi 1502 . 2  |-  ( A. x  e.  A  A. y  e.  B  C  =  x  ->  A. y E* x ( x  e.  A  /\  y  e.  B ) )
13 dfdisj2 3908 . 2  |-  (Disj  x  e.  A  B  <->  A. y E* x ( x  e.  A  /\  y  e.  B ) )
1412, 13sylibr 133 1  |-  ( A. x  e.  A  A. y  e.  B  C  =  x  -> Disj  x  e.  A  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103   A.wal 1329    = wceq 1331    e. wcel 1480   E*wmo 2000   A.wral 2416  Disj wdisj 3906
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-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rmo 2424  df-v 2688  df-disj 3907
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator