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

Theorem djuinj 7410
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 (𝜑 → Fun 𝑅)
djuinj.s (𝜑 → Fun 𝑆)
djuinj.disj (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
Assertion
Ref Expression
djuinj (𝜑 → Fun (𝑅d 𝑆))

Proof of Theorem djuinj
StepHypRef Expression
1 inlresf1 7365 . . . . . . 7 (inl ↾ dom 𝑅):dom 𝑅1-1→(dom 𝑅𝐴)
2 f1fun 5581 . . . . . . 7 ((inl ↾ dom 𝑅):dom 𝑅1-1→(dom 𝑅𝐴) → Fun (inl ↾ dom 𝑅))
31, 2ax-mp 5 . . . . . 6 Fun (inl ↾ dom 𝑅)
4 funcnvcnv 5420 . . . . . 6 (Fun (inl ↾ dom 𝑅) → Fun (inl ↾ dom 𝑅))
53, 4ax-mp 5 . . . . 5 Fun (inl ↾ dom 𝑅)
6 djuinj.r . . . . 5 (𝜑 → Fun 𝑅)
7 funco 5397 . . . . 5 ((Fun (inl ↾ dom 𝑅) ∧ Fun 𝑅) → Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
85, 6, 7sylancr 414 . . . 4 (𝜑 → Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
9 cnvco 4945 . . . . 5 (𝑅(inl ↾ dom 𝑅)) = ((inl ↾ dom 𝑅) ∘ 𝑅)
109funeqi 5378 . . . 4 (Fun (𝑅(inl ↾ dom 𝑅)) ↔ Fun ((inl ↾ dom 𝑅) ∘ 𝑅))
118, 10sylibr 134 . . 3 (𝜑 → Fun (𝑅(inl ↾ dom 𝑅)))
12 inrresf1 7366 . . . . . . 7 (inr ↾ dom 𝑆):dom 𝑆1-1→(𝐴 ⊔ dom 𝑆)
13 f1fun 5581 . . . . . . 7 ((inr ↾ dom 𝑆):dom 𝑆1-1→(𝐴 ⊔ dom 𝑆) → Fun (inr ↾ dom 𝑆))
1412, 13ax-mp 5 . . . . . 6 Fun (inr ↾ dom 𝑆)
15 funcnvcnv 5420 . . . . . 6 (Fun (inr ↾ dom 𝑆) → Fun (inr ↾ dom 𝑆))
1614, 15ax-mp 5 . . . . 5 Fun (inr ↾ dom 𝑆)
17 djuinj.s . . . . 5 (𝜑 → Fun 𝑆)
18 funco 5397 . . . . 5 ((Fun (inr ↾ dom 𝑆) ∧ Fun 𝑆) → Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
1916, 17, 18sylancr 414 . . . 4 (𝜑 → Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
20 cnvco 4945 . . . . 5 (𝑆(inr ↾ dom 𝑆)) = ((inr ↾ dom 𝑆) ∘ 𝑆)
2120funeqi 5378 . . . 4 (Fun (𝑆(inr ↾ dom 𝑆)) ↔ Fun ((inr ↾ dom 𝑆) ∘ 𝑆))
2219, 21sylibr 134 . . 3 (𝜑 → Fun (𝑆(inr ↾ dom 𝑆)))
23 df-rn 4765 . . . . . . 7 ran (𝑅(inl ↾ dom 𝑅)) = dom (𝑅(inl ↾ dom 𝑅))
24 rncoss 5033 . . . . . . 7 ran (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅
2523, 24eqsstrri 3275 . . . . . 6 dom (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅
26 df-rn 4765 . . . . . . 7 ran (𝑆(inr ↾ dom 𝑆)) = dom (𝑆(inr ↾ dom 𝑆))
27 rncoss 5033 . . . . . . 7 ran (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆
2826, 27eqsstrri 3275 . . . . . 6 dom (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆
29 ss2in 3453 . . . . . 6 ((dom (𝑅(inl ↾ dom 𝑅)) ⊆ ran 𝑅 ∧ dom (𝑆(inr ↾ dom 𝑆)) ⊆ ran 𝑆) → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆))
3025, 28, 29mp2an 426 . . . . 5 (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆)
31 djuinj.disj . . . . 5 (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
3230, 31sseqtrid 3292 . . . 4 (𝜑 → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ ∅)
33 ss0 3553 . . . 4 ((dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) ⊆ ∅ → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅)
3432, 33syl 14 . . 3 (𝜑 → (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅)
35 funun 5402 . . 3 (((Fun (𝑅(inl ↾ dom 𝑅)) ∧ Fun (𝑆(inr ↾ dom 𝑆))) ∧ (dom (𝑅(inl ↾ dom 𝑅)) ∩ dom (𝑆(inr ↾ dom 𝑆))) = ∅) → Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
3611, 22, 34, 35syl21anc 1273 . 2 (𝜑 → Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
37 df-djud 7407 . . . . 5 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
3837cnveqi 4935 . . . 4 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
39 cnvun 5173 . . . 4 ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
4038, 39eqtri 2255 . . 3 (𝑅d 𝑆) = ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆)))
4140funeqi 5378 . 2 (Fun (𝑅d 𝑆) ↔ Fun ((𝑅(inl ↾ dom 𝑅)) ∪ (𝑆(inr ↾ dom 𝑆))))
4236, 41sylibr 134 1 (𝜑 → Fun (𝑅d 𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  cun 3212  cin 3213  wss 3214  c0 3512  ccnv 4753  dom cdm 4754  ran crn 4755  cres 4756  ccom 4758  Fun wfun 5351  1-1wf1 5354  cdju 7341  inlcinl 7349  inrcinr 7350  d cdjud 7406
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-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  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-dju 7342  df-inl 7351  df-inr 7352  df-djud 7407
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator