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

Theorem caseinj 7331
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 7289 . . . . . . 7 inl = (𝑦 ∈ V ↦ ⟨∅, 𝑦⟩)
21funmpt2 5372 . . . . . 6 Fun inl
3 funcnvcnv 5396 . . . . . 6 (Fun inl → Fun inl)
42, 3ax-mp 5 . . . . 5 Fun inl
5 caseinj.r . . . . 5 (𝜑 → Fun 𝑅)
6 funco 5373 . . . . 5 ((Fun inl ∧ Fun 𝑅) → Fun (inl ∘ 𝑅))
74, 5, 6sylancr 414 . . . 4 (𝜑 → Fun (inl ∘ 𝑅))
8 cnvco 4921 . . . . 5 (𝑅inl) = (inl ∘ 𝑅)
98funeqi 5354 . . . 4 (Fun (𝑅inl) ↔ Fun (inl ∘ 𝑅))
107, 9sylibr 134 . . 3 (𝜑 → Fun (𝑅inl))
11 df-inr 7290 . . . . . . 7 inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
1211funmpt2 5372 . . . . . 6 Fun inr
13 funcnvcnv 5396 . . . . . 6 (Fun inr → Fun inr)
1412, 13ax-mp 5 . . . . 5 Fun inr
15 caseinj.s . . . . 5 (𝜑 → Fun 𝑆)
16 funco 5373 . . . . 5 ((Fun inr ∧ Fun 𝑆) → Fun (inr ∘ 𝑆))
1714, 15, 16sylancr 414 . . . 4 (𝜑 → Fun (inr ∘ 𝑆))
18 cnvco 4921 . . . . 5 (𝑆inr) = (inr ∘ 𝑆)
1918funeqi 5354 . . . 4 (Fun (𝑆inr) ↔ Fun (inr ∘ 𝑆))
2017, 19sylibr 134 . . 3 (𝜑 → Fun (𝑆inr))
21 df-rn 4742 . . . . . . 7 ran (𝑅inl) = dom (𝑅inl)
22 rncoss 5009 . . . . . . 7 ran (𝑅inl) ⊆ ran 𝑅
2321, 22eqsstrri 3261 . . . . . 6 dom (𝑅inl) ⊆ ran 𝑅
24 df-rn 4742 . . . . . . 7 ran (𝑆inr) = dom (𝑆inr)
25 rncoss 5009 . . . . . . 7 ran (𝑆inr) ⊆ ran 𝑆
2624, 25eqsstrri 3261 . . . . . 6 dom (𝑆inr) ⊆ ran 𝑆
27 ss2in 3437 . . . . . 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 3278 . . . 4 (𝜑 → (dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ ∅)
31 ss0 3537 . . . 4 ((dom (𝑅inl) ∩ dom (𝑆inr)) ⊆ ∅ → (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅)
3230, 31syl 14 . . 3 (𝜑 → (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅)
33 funun 5378 . . 3 (((Fun (𝑅inl) ∧ Fun (𝑆inr)) ∧ (dom (𝑅inl) ∩ dom (𝑆inr)) = ∅) → Fun ((𝑅inl) ∪ (𝑆inr)))
3410, 20, 32, 33syl21anc 1273 . 2 (𝜑 → Fun ((𝑅inl) ∪ (𝑆inr)))
35 df-case 7326 . . . . 5 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
3635cnveqi 4911 . . . 4 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
37 cnvun 5149 . . . 4 ((𝑅inl) ∪ (𝑆inr)) = ((𝑅inl) ∪ (𝑆inr))
3836, 37eqtri 2252 . . 3 case(𝑅, 𝑆) = ((𝑅inl) ∪ (𝑆inr))
3938funeqi 5354 . 2 (Fun case(𝑅, 𝑆) ↔ Fun ((𝑅inl) ∪ (𝑆inr)))
4034, 39sylibr 134 1 (𝜑 → Fun case(𝑅, 𝑆))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1398  Vcvv 2803  cun 3199  cin 3200  wss 3201  c0 3496  cop 3676  ccnv 4730  dom cdm 4731  ran crn 4732  ccom 4735  Fun wfun 5327  1oc1o 6618  inlcinl 7287  inrcinr 7288  casecdjucase 7325
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-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-fun 5335  df-inl 7289  df-inr 7290  df-case 7326
This theorem is referenced by:  casef1  7332
  Copyright terms: Public domain W3C validator