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

Theorem djuinj 7436
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 7391 . . . . . . 7  |-  (inl  |`  dom  R
) : dom  R -1-1-> ( dom  R A )
2 f1fun 5596 . . . . . . 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 5435 . . . . . 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 5412 . . . . 5  |-  ( ( Fun  `' `' (inl  |`  dom  R )  /\  Fun  `' R )  ->  Fun  ( `' `' (inl  |`  dom  R
)  o.  `' R
) )
85, 6, 7sylancr 418 . . . 4  |-  ( ph  ->  Fun  ( `' `' (inl  |`  dom  R )  o.  `' R ) )
9 cnvco 4960 . . . . 5  |-  `' ( R  o.  `' (inl  |`  dom  R ) )  =  ( `' `' (inl  |`  dom  R )  o.  `' R )
109funeqi 5393 . . . 4  |-  ( Fun  `' ( R  o.  `' (inl  |`  dom  R
) )  <->  Fun  ( `' `' (inl  |`  dom  R
)  o.  `' R
) )
118, 10sylibr 134 . . 3  |-  ( ph  ->  Fun  `' ( R  o.  `' (inl  |`  dom  R
) ) )
12 inrresf1 7392 . . . . . . 7  |-  (inr  |`  dom  S
) : dom  S -1-1-> ( A dom  S )
13 f1fun 5596 . . . . . . 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 5435 . . . . . 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 5412 . . . . 5  |-  ( ( Fun  `' `' (inr  |`  dom  S )  /\  Fun  `' S )  ->  Fun  ( `' `' (inr  |`  dom  S
)  o.  `' S
) )
1916, 17, 18sylancr 418 . . . 4  |-  ( ph  ->  Fun  ( `' `' (inr  |`  dom  S )  o.  `' S ) )
20 cnvco 4960 . . . . 5  |-  `' ( S  o.  `' (inr  |`  dom  S ) )  =  ( `' `' (inr  |`  dom  S )  o.  `' S )
2120funeqi 5393 . . . 4  |-  ( Fun  `' ( S  o.  `' (inr  |`  dom  S
) )  <->  Fun  ( `' `' (inr  |`  dom  S
)  o.  `' S
) )
2219, 21sylibr 134 . . 3  |-  ( ph  ->  Fun  `' ( S  o.  `' (inr  |`  dom  S
) ) )
23 df-rn 4780 . . . . . . 7  |-  ran  ( R  o.  `' (inl  |` 
dom  R ) )  =  dom  `' ( R  o.  `' (inl  |`  dom  R ) )
24 rncoss 5048 . . . . . . 7  |-  ran  ( R  o.  `' (inl  |` 
dom  R ) ) 
C_  ran  R
2523, 24eqsstrri 3281 . . . . . 6  |-  dom  `' ( R  o.  `' (inl  |`  dom  R ) )  C_  ran  R
26 df-rn 4780 . . . . . . 7  |-  ran  ( S  o.  `' (inr  |` 
dom  S ) )  =  dom  `' ( S  o.  `' (inr  |`  dom  S ) )
27 rncoss 5048 . . . . . . 7  |-  ran  ( S  o.  `' (inr  |` 
dom  S ) ) 
C_  ran  S
2826, 27eqsstrri 3281 . . . . . 6  |-  dom  `' ( S  o.  `' (inr  |`  dom  S ) )  C_  ran  S
29 ss2in 3459 . . . . . 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 430 . . . . 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 3298 . . . 4  |-  ( ph  ->  ( dom  `' ( R  o.  `' (inl  |`  dom  R ) )  i^i  dom  `' ( S  o.  `' (inr  |` 
dom  S ) ) )  C_  (/) )
33 ss0 3563 . . . 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 5417 . . 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 1277 . 2  |-  ( ph  ->  Fun  ( `' ( R  o.  `' (inl  |`  dom  R ) )  u.  `' ( S  o.  `' (inr  |`  dom  S
) ) ) )
37 df-djud 7433 . . . . 5  |-  ( R ⊔d  S )  =  ( ( R  o.  `' (inl  |`  dom  R ) )  u.  ( S  o.  `' (inr  |`  dom  S
) ) )
3837cnveqi 4950 . . . 4  |-  `' ( R ⊔d  S )  =  `' ( ( R  o.  `' (inl  |`  dom  R
) )  u.  ( S  o.  `' (inr  |` 
dom  S ) ) )
39 cnvun 5188 . . . 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 2259 . . 3  |-  `' ( R ⊔d  S )  =  ( `' ( R  o.  `' (inl  |`  dom  R
) )  u.  `' ( S  o.  `' (inr  |`  dom  S ) ) )
4140funeqi 5393 . 2  |-  ( Fun  `' ( R ⊔d  S )  <->  Fun  ( `' ( R  o.  `' (inl  |`  dom  R
) )  u.  `' ( S  o.  `' (inr  |`  dom  S ) ) ) )
4236, 41sylibr 134 1  |-  ( ph  ->  Fun  `' ( R ⊔d  S ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1402    u. cun 3218    i^i cin 3219    C_ wss 3220   (/)c0 3520   `'ccnv 4768   dom cdm 4769   ran crn 4770    |` cres 4771    o. ccom 4773   Fun wfun 5366   -1-1->wf1 5369   ⊔ cdju 7367  inlcinl 7375  inrcinr 7376   ⊔d cdjud 7432
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-nul 4254  ax-pow 4306  ax-pr 4341  ax-un 4573
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-br 4126  df-opab 4188  df-mpt 4189  df-tr 4225  df-id 4433  df-iord 4506  df-on 4508  df-suc 4511  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-1st 6364  df-2nd 6365  df-1o 6677  df-dju 7368  df-inl 7377  df-inr 7378  df-djud 7433
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator