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

Theorem djuinr 7367
Description: The ranges of any left and right injections are disjoint. Remark: the extra generality offered by the two restrictions makes the theorem more readily usable (e.g., by djudom 7397 and djufun 7408) while the simpler statement  |-  ( ran inl  i^i 
ran inr )  =  (/) is easily recovered from it by substituting  _V for both  A and  B as done in casefun 7389). (Contributed by BJ and Jim Kingdon, 21-Jun-2022.)
Assertion
Ref Expression
djuinr  |-  ( ran  (inl  |`  A )  i^i 
ran  (inr  |`  B ) )  =  (/)

Proof of Theorem djuinr
StepHypRef Expression
1 djulf1or 7360 . . . 4  |-  (inl  |`  A ) : A -1-1-onto-> ( { (/) }  X.  A )
2 dff1o5 5628 . . . . 5  |-  ( (inl  |`  A ) : A -1-1-onto-> ( { (/) }  X.  A
)  <->  ( (inl  |`  A ) : A -1-1-> ( {
(/) }  X.  A
)  /\  ran  (inl  |`  A )  =  ( { (/) }  X.  A ) ) )
32simprbi 275 . . . 4  |-  ( (inl  |`  A ) : A -1-1-onto-> ( { (/) }  X.  A
)  ->  ran  (inl  |`  A )  =  ( { (/) }  X.  A ) )
41, 3ax-mp 5 . . 3  |-  ran  (inl  |`  A )  =  ( { (/) }  X.  A
)
5 djurf1or 7361 . . . 4  |-  (inr  |`  B ) : B -1-1-onto-> ( { 1o }  X.  B )
6 dff1o5 5628 . . . . 5  |-  ( (inr  |`  B ) : B -1-1-onto-> ( { 1o }  X.  B
)  <->  ( (inr  |`  B ) : B -1-1-> ( { 1o }  X.  B
)  /\  ran  (inr  |`  B )  =  ( { 1o }  X.  B ) ) )
76simprbi 275 . . . 4  |-  ( (inr  |`  B ) : B -1-1-onto-> ( { 1o }  X.  B
)  ->  ran  (inr  |`  B )  =  ( { 1o }  X.  B ) )
85, 7ax-mp 5 . . 3  |-  ran  (inr  |`  B )  =  ( { 1o }  X.  B )
94, 8ineq12i 3424 . 2  |-  ( ran  (inl  |`  A )  i^i 
ran  (inr  |`  B ) )  =  ( ( { (/) }  X.  A
)  i^i  ( { 1o }  X.  B ) )
10 1n0 6678 . . . . 5  |-  1o  =/=  (/)
1110necomi 2499 . . . 4  |-  (/)  =/=  1o
12 disjsn2 3757 . . . 4  |-  ( (/)  =/=  1o  ->  ( { (/)
}  i^i  { 1o } )  =  (/) )
1311, 12ax-mp 5 . . 3  |-  ( {
(/) }  i^i  { 1o } )  =  (/)
14 xpdisj1 5192 . . 3  |-  ( ( { (/) }  i^i  { 1o } )  =  (/)  ->  ( ( { (/) }  X.  A )  i^i  ( { 1o }  X.  B ) )  =  (/) )
1513, 14ax-mp 5 . 2  |-  ( ( { (/) }  X.  A
)  i^i  ( { 1o }  X.  B ) )  =  (/)
169, 15eqtri 2255 1  |-  ( ran  (inl  |`  A )  i^i 
ran  (inr  |`  B ) )  =  (/)
Colors of variables: wff set class
Syntax hints:    = wceq 1398    =/= wne 2414    i^i cin 3213   (/)c0 3512   {csn 3694    X. cxp 4752   ran crn 4755    |` cres 4756   -1-1->wf1 5354   -1-1-onto->wf1o 5356   1oc1o 6653  inlcinl 7349  inrcinr 7350
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-1st 6347  df-2nd 6348  df-1o 6660  df-inl 7351  df-inr 7352
This theorem is referenced by:  djuin  7368  casefun  7389  djudom  7397  djufun  7408
  Copyright terms: Public domain W3C validator