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

Theorem caseinj 7252
Description: The "case" construction of two injective relations with disjoint ranges is an injective relation. (Contributed by BJ, 10-Jul-2022.)
Hypotheses
Ref Expression
caseinj.r (𝜑 → Fun 𝑅)
caseinj.s (𝜑 → Fun 𝑆)
caseinj.disj (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
Assertion
Ref Expression
caseinj (𝜑 → Fun case(𝑅, 𝑆))

Proof of Theorem caseinj
StepHypRef Expression
1 df-inl 7210 . . . . . . 7 inl = (𝑦 ∈ V ↦ ⟨∅, 𝑦⟩)
21funmpt2 5356 . . . . . 6 Fun inl
3 funcnvcnv 5379 . . . . . 6 (Fun inl → Fun inl)
42, 3ax-mp 5 . . . . 5 Fun inl
5 caseinj.r . . . . 5 (𝜑 → Fun 𝑅)
6 funco 5357 . . . . 5 ((Fun inl ∧ Fun 𝑅) → Fun (inl ∘ 𝑅))
74, 5, 6sylancr 414 . . . 4 (𝜑 → Fun (inl ∘ 𝑅))
8 cnvco 4906 . . . . 5 (𝑅inl) = (inl ∘ 𝑅)
98funeqi 5338 . . . 4 (Fun (𝑅inl) ↔ Fun (inl ∘ 𝑅))
107, 9sylibr 134 . . 3 (𝜑 → Fun (𝑅inl))
11 df-inr 7211 . . . . . . 7 inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
1211funmpt2 5356 . . . . . 6 Fun inr
13 funcnvcnv 5379 . . . . . 6 (Fun inr → Fun inr)
1412, 13ax-mp 5 . . . . 5 Fun inr
15 caseinj.s . . . . 5 (𝜑 → Fun 𝑆)
16 funco 5357 . . . . 5 ((Fun inr ∧ Fun 𝑆) → Fun (inr ∘ 𝑆))
1714, 15, 16sylancr 414 . . . 4 (𝜑 → Fun (inr ∘ 𝑆))
18 cnvco 4906 . . . . 5 (𝑆inr) = (inr ∘ 𝑆)
1918funeqi 5338 . . . 4 (Fun (𝑆inr) ↔ Fun (inr ∘ 𝑆))
2017, 19sylibr 134 . . 3 (𝜑 → Fun (𝑆inr))
21 df-rn 4729 . . . . . . 7 ran (𝑅inl) = dom (𝑅inl)
22 rncoss 4994 . . . . . . 7 ran (𝑅inl) ⊆ ran 𝑅
2321, 22eqsstrri 3257 . . . . . 6 dom (𝑅inl) ⊆ ran 𝑅
24 df-rn 4729 . . . . . . 7 ran (𝑆inr) = dom (𝑆inr)
25 rncoss 4994 . . . . . . 7 ran (𝑆inr) ⊆ ran 𝑆
2624, 25eqsstrri 3257 . . . . . 6 dom (𝑆inr) ⊆ ran 𝑆
27 ss2in 3432 . . . . . 6 ((dom (𝑅inl) ⊆ ran 𝑅 ∧ dom (𝑆inr) ⊆ ran 𝑆) → (dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ (ran 𝑅 ∩ ran 𝑆))
2823, 26, 27mp2an 426 . . . . 5 (dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ (ran 𝑅 ∩ ran 𝑆)
29 caseinj.disj . . . . 5 (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
3028, 29sseqtrid 3274 . . . 4 (𝜑 → (dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ ∅)
31 ss0 3532 . . . 4 ((dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ ∅ → (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅)
3230, 31syl 14 . . 3 (𝜑 → (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅)
33 funun 5361 . . 3 (((Fun (𝑅inl) ∧ Fun (𝑆inr)) ∧ (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅) → Fun ((𝑅inl) ∪ (𝑆inr)))
3410, 20, 32, 33syl21anc 1270 . 2 (𝜑 → Fun ((𝑅inl) ∪ (𝑆inr)))
35 df-case 7247 . . . . 5 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
3635cnveqi 4896 . . . 4 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
37 cnvun 5133 . . . 4 ((𝑅inl) ∪ (𝑆inr)) = ((𝑅inl) ∪ (𝑆inr))
3836, 37eqtri 2250 . . 3 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
3938funeqi 5338 . 2 (Fun case(𝑅, 𝑆) ↔ Fun ((𝑅inl) ∪ (𝑆inr)))
4034, 39sylibr 134 1 (𝜑 → Fun case(𝑅, 𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1395  Vcvv 2799  cun 3195  cin 3196  wss 3197  c0 3491  cop 3669  ccnv 4717  dom cdm 4718  ran crn 4719  ccom 4722  Fun wfun 5311  1oc1o 6553  inlcinl 7208  inrcinr 7209  casecdjucase 7246
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4083  df-opab 4145  df-mpt 4146  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-fun 5319  df-inl 7210  df-inr 7211  df-case 7247
This theorem is referenced by:  casef1  7253
  Copyright terms: Public domain W3C validator