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

Theorem djuinj 6991
Description: The "domain-disjoint-union" of two injective relations with disjoint ranges is an injective relation. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
djuinj.r  |-  ( ph  ->  Fun  `' R )
djuinj.s  |-  ( ph  ->  Fun  `' S )
djuinj.disj  |-  ( ph  ->  ( ran  R  i^i  ran 
S )  =  (/) )
Assertion
Ref Expression
djuinj  |-  ( ph  ->  Fun  `' ( R ⊔d  S ) )

Proof of Theorem djuinj
StepHypRef Expression
1 inlresf1 6946 . . . . . . 7  |-  (inl  |`  dom  R
) : dom  R -1-1-> ( dom  R A )
2 f1fun 5331 . . . . . . 7  |-  ( (inl  |`  dom  R ) : dom  R -1-1-> ( dom 
R A )  ->  Fun  (inl  |`  dom  R ) )
31, 2ax-mp 5 . . . . . 6  |-  Fun  (inl  |` 
dom  R )
4 funcnvcnv 5182 . . . . . 6  |-  ( Fun  (inl  |`  dom  R )  ->  Fun  `' `' (inl  |`  dom  R ) )
53, 4ax-mp 5 . . . . 5  |-  Fun  `' `' (inl  |`  dom  R
)
6 djuinj.r . . . . 5  |-  ( ph  ->  Fun  `' R )
7 funco 5163 . . . . 5  |-  ( ( Fun  `' `' (inl  |`  dom  R )  /\  Fun  `' R )  ->  Fun  ( `' `' (inl  |`  dom  R
)  o.  `' R
) )
85, 6, 7sylancr 410 . . . 4  |-  ( ph  ->  Fun  ( `' `' (inl  |`  dom  R )  o.  `' R ) )
9 cnvco 4724 . . . . 5  |-  `' ( R  o.  `' (inl  |`  dom  R ) )  =  ( `' `' (inl  |`  dom  R )  o.  `' R )
109funeqi 5144 . . . 4  |-  ( Fun  `' ( R  o.  `' (inl  |`  dom  R
) )  <->  Fun  ( `' `' (inl  |`  dom  R
)  o.  `' R
) )
118, 10sylibr 133 . . 3  |-  ( ph  ->  Fun  `' ( R  o.  `' (inl  |`  dom  R
) ) )
12 inrresf1 6947 . . . . . . 7  |-  (inr  |`  dom  S
) : dom  S -1-1-> ( A dom  S )
13 f1fun 5331 . . . . . . 7  |-  ( (inr  |`  dom  S ) : dom  S -1-1-> ( A dom  S )  ->  Fun  (inr  |`  dom  S ) )
1412, 13ax-mp 5 . . . . . 6  |-  Fun  (inr  |` 
dom  S )
15 funcnvcnv 5182 . . . . . 6  |-  ( Fun  (inr  |`  dom  S )  ->  Fun  `' `' (inr  |`  dom  S ) )
1614, 15ax-mp 5 . . . . 5  |-  Fun  `' `' (inr  |`  dom  S
)
17 djuinj.s . . . . 5  |-  ( ph  ->  Fun  `' S )
18 funco 5163 . . . . 5  |-  ( ( Fun  `' `' (inr  |`  dom  S )  /\  Fun  `' S )  ->  Fun  ( `' `' (inr  |`  dom  S
)  o.  `' S
) )
1916, 17, 18sylancr 410 . . . 4  |-  ( ph  ->  Fun  ( `' `' (inr  |`  dom  S )  o.  `' S ) )
20 cnvco 4724 . . . . 5  |-  `' ( S  o.  `' (inr  |`  dom  S ) )  =  ( `' `' (inr  |`  dom  S )  o.  `' S )
2120funeqi 5144 . . . 4  |-  ( Fun  `' ( S  o.  `' (inr  |`  dom  S
) )  <->  Fun  ( `' `' (inr  |`  dom  S
)  o.  `' S
) )
2219, 21sylibr 133 . . 3  |-  ( ph  ->  Fun  `' ( S  o.  `' (inr  |`  dom  S
) ) )
23 df-rn 4550 . . . . . . 7  |-  ran  ( R  o.  `' (inl  |` 
dom  R ) )  =  dom  `' ( R  o.  `' (inl  |`  dom  R ) )
24 rncoss 4809 . . . . . . 7  |-  ran  ( R  o.  `' (inl  |` 
dom  R ) ) 
C_  ran  R
2523, 24eqsstrri 3130 . . . . . 6  |-  dom  `' ( R  o.  `' (inl  |`  dom  R ) )  C_  ran  R
26 df-rn 4550 . . . . . . 7  |-  ran  ( S  o.  `' (inr  |` 
dom  S ) )  =  dom  `' ( S  o.  `' (inr  |`  dom  S ) )
27 rncoss 4809 . . . . . . 7  |-  ran  ( S  o.  `' (inr  |` 
dom  S ) ) 
C_  ran  S
2826, 27eqsstrri 3130 . . . . . 6  |-  dom  `' ( S  o.  `' (inr  |`  dom  S ) )  C_  ran  S
29 ss2in 3304 . . . . . 6  |-  ( ( dom  `' ( R  o.  `' (inl  |`  dom  R
) )  C_  ran  R  /\  dom  `' ( S  o.  `' (inr  |`  dom  S ) ) 
C_  ran  S )  ->  ( dom  `' ( R  o.  `' (inl  |`  dom  R ) )  i^i  dom  `' ( S  o.  `' (inr  |` 
dom  S ) ) )  C_  ( ran  R  i^i  ran  S )
)
3025, 28, 29mp2an 422 . . . . 5  |-  ( dom  `' ( R  o.  `' (inl  |`  dom  R
) )  i^i  dom  `' ( S  o.  `' (inr  |`  dom  S ) ) )  C_  ( ran  R  i^i  ran  S
)
31 djuinj.disj . . . . 5  |-  ( ph  ->  ( ran  R  i^i  ran 
S )  =  (/) )
3230, 31sseqtrid 3147 . . . 4  |-  ( ph  ->  ( dom  `' ( R  o.  `' (inl  |`  dom  R ) )  i^i  dom  `' ( S  o.  `' (inr  |` 
dom  S ) ) )  C_  (/) )
33 ss0 3403 . . . 4  |-  ( ( dom  `' ( R  o.  `' (inl  |`  dom  R
) )  i^i  dom  `' ( S  o.  `' (inr  |`  dom  S ) ) )  C_  (/)  ->  ( dom  `' ( R  o.  `' (inl  |`  dom  R
) )  i^i  dom  `' ( S  o.  `' (inr  |`  dom  S ) ) )  =  (/) )
3432, 33syl 14 . . 3  |-  ( ph  ->  ( dom  `' ( R  o.  `' (inl  |`  dom  R ) )  i^i  dom  `' ( S  o.  `' (inr  |` 
dom  S ) ) )  =  (/) )
35 funun 5167 . . 3  |-  ( ( ( Fun  `' ( R  o.  `' (inl  |`  dom  R ) )  /\  Fun  `' ( S  o.  `' (inr  |`  dom  S ) ) )  /\  ( dom  `' ( R  o.  `' (inl  |`  dom  R
) )  i^i  dom  `' ( S  o.  `' (inr  |`  dom  S ) ) )  =  (/) )  ->  Fun  ( `' ( R  o.  `' (inl  |`  dom  R ) )  u.  `' ( S  o.  `' (inr  |`  dom  S ) ) ) )
3611, 22, 34, 35syl21anc 1215 . 2  |-  ( ph  ->  Fun  ( `' ( R  o.  `' (inl  |`  dom  R ) )  u.  `' ( S  o.  `' (inr  |`  dom  S
) ) ) )
37 df-djud 6988 . . . . 5  |-  ( R ⊔d  S )  =  ( ( R  o.  `' (inl  |`  dom  R ) )  u.  ( S  o.  `' (inr  |`  dom  S
) ) )
3837cnveqi 4714 . . . 4  |-  `' ( R ⊔d  S )  =  `' ( ( R  o.  `' (inl  |`  dom  R
) )  u.  ( S  o.  `' (inr  |` 
dom  S ) ) )
39 cnvun 4944 . . . 4  |-  `' ( ( R  o.  `' (inl  |`  dom  R ) )  u.  ( S  o.  `' (inr  |`  dom  S
) ) )  =  ( `' ( R  o.  `' (inl  |`  dom  R
) )  u.  `' ( S  o.  `' (inr  |`  dom  S ) ) )
4038, 39eqtri 2160 . . 3  |-  `' ( R ⊔d  S )  =  ( `' ( R  o.  `' (inl  |`  dom  R
) )  u.  `' ( S  o.  `' (inr  |`  dom  S ) ) )
4140funeqi 5144 . 2  |-  ( Fun  `' ( R ⊔d  S )  <->  Fun  ( `' ( R  o.  `' (inl  |`  dom  R
) )  u.  `' ( S  o.  `' (inr  |`  dom  S ) ) ) )
4236, 41sylibr 133 1  |-  ( ph  ->  Fun  `' ( R ⊔d  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1331    u. cun 3069    i^i cin 3070    C_ wss 3071   (/)c0 3363   `'ccnv 4538   dom cdm 4539   ran crn 4540    |` cres 4541    o. ccom 4543   Fun wfun 5117   -1-1->wf1 5120   ⊔ cdju 6922  inlcinl 6930  inrcinr 6931   ⊔d cdjud 6987
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 603  ax-in2 604  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-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-nul 4054  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  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-rex 2422  df-v 2688  df-sbc 2910  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-nul 3364  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-tr 4027  df-id 4215  df-iord 4288  df-on 4290  df-suc 4293  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-1st 6038  df-2nd 6039  df-1o 6313  df-dju 6923  df-inl 6932  df-inr 6933  df-djud 6988
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator