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

Theorem caseinj 7155
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 7113 . . . . . . 7 inl = (𝑦 ∈ V ↦ ⟨∅, 𝑦⟩)
21funmpt2 5297 . . . . . 6 Fun inl
3 funcnvcnv 5317 . . . . . 6 (Fun inl → Fun inl)
42, 3ax-mp 5 . . . . 5 Fun inl
5 caseinj.r . . . . 5 (𝜑 → Fun 𝑅)
6 funco 5298 . . . . 5 ((Fun inl ∧ Fun 𝑅) → Fun (inl ∘ 𝑅))
74, 5, 6sylancr 414 . . . 4 (𝜑 → Fun (inl ∘ 𝑅))
8 cnvco 4851 . . . . 5 (𝑅inl) = (inl ∘ 𝑅)
98funeqi 5279 . . . 4 (Fun (𝑅inl) ↔ Fun (inl ∘ 𝑅))
107, 9sylibr 134 . . 3 (𝜑 → Fun (𝑅inl))
11 df-inr 7114 . . . . . . 7 inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
1211funmpt2 5297 . . . . . 6 Fun inr
13 funcnvcnv 5317 . . . . . 6 (Fun inr → Fun inr)
1412, 13ax-mp 5 . . . . 5 Fun inr
15 caseinj.s . . . . 5 (𝜑 → Fun 𝑆)
16 funco 5298 . . . . 5 ((Fun inr ∧ Fun 𝑆) → Fun (inr ∘ 𝑆))
1714, 15, 16sylancr 414 . . . 4 (𝜑 → Fun (inr ∘ 𝑆))
18 cnvco 4851 . . . . 5 (𝑆inr) = (inr ∘ 𝑆)
1918funeqi 5279 . . . 4 (Fun (𝑆inr) ↔ Fun (inr ∘ 𝑆))
2017, 19sylibr 134 . . 3 (𝜑 → Fun (𝑆inr))
21 df-rn 4674 . . . . . . 7 ran (𝑅inl) = dom (𝑅inl)
22 rncoss 4936 . . . . . . 7 ran (𝑅inl) ⊆ ran 𝑅
2321, 22eqsstrri 3216 . . . . . 6 dom (𝑅inl) ⊆ ran 𝑅
24 df-rn 4674 . . . . . . 7 ran (𝑆inr) = dom (𝑆inr)
25 rncoss 4936 . . . . . . 7 ran (𝑆inr) ⊆ ran 𝑆
2624, 25eqsstrri 3216 . . . . . 6 dom (𝑆inr) ⊆ ran 𝑆
27 ss2in 3391 . . . . . 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 3233 . . . 4 (𝜑 → (dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ ∅)
31 ss0 3491 . . . 4 ((dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ ∅ → (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅)
3230, 31syl 14 . . 3 (𝜑 → (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅)
33 funun 5302 . . 3 (((Fun (𝑅inl) ∧ Fun (𝑆inr)) ∧ (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅) → Fun ((𝑅inl) ∪ (𝑆inr)))
3410, 20, 32, 33syl21anc 1248 . 2 (𝜑 → Fun ((𝑅inl) ∪ (𝑆inr)))
35 df-case 7150 . . . . 5 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
3635cnveqi 4841 . . . 4 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
37 cnvun 5075 . . . 4 ((𝑅inl) ∪ (𝑆inr)) = ((𝑅inl) ∪ (𝑆inr))
3836, 37eqtri 2217 . . 3 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
3938funeqi 5279 . 2 (Fun case(𝑅, 𝑆) ↔ Fun ((𝑅inl) ∪ (𝑆inr)))
4034, 39sylibr 134 1 (𝜑 → Fun case(𝑅, 𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1364  Vcvv 2763  cun 3155  cin 3156  wss 3157  c0 3450  cop 3625  ccnv 4662  dom cdm 4663  ran crn 4664  ccom 4667  Fun wfun 5252  1oc1o 6467  inlcinl 7111  inrcinr 7112  casecdjucase 7149
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 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-fun 5260  df-inl 7113  df-inr 7114  df-case 7150
This theorem is referenced by:  casef1  7156
  Copyright terms: Public domain W3C validator