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

Theorem caseinr 7048
Description: Applying the "case" construction to a right injection. (Contributed by Jim Kingdon, 12-Jul-2023.)
Hypotheses
Ref Expression
caseinr.f (𝜑 → Fun 𝐹)
caseinr.g (𝜑𝐺 Fn 𝐵)
caseinr.a (𝜑𝐴𝐵)
Assertion
Ref Expression
caseinr (𝜑 → (case(𝐹, 𝐺)‘(inr‘𝐴)) = (𝐺𝐴))

Proof of Theorem caseinr
StepHypRef Expression
1 df-case 7040 . . . 4 case(𝐹, 𝐺) = ((𝐹inl) ∪ (𝐺inr))
21fveq1i 5481 . . 3 (case(𝐹, 𝐺)‘(inr‘𝐴)) = (((𝐹inl) ∪ (𝐺inr))‘(inr‘𝐴))
3 caseinr.f . . . . . 6 (𝜑 → Fun 𝐹)
4 djulf1o 7014 . . . . . . . 8 inl:V–1-1-onto→({∅} × V)
5 f1ocnv 5439 . . . . . . . 8 (inl:V–1-1-onto→({∅} × V) → inl:({∅} × V)–1-1-onto→V)
64, 5ax-mp 5 . . . . . . 7 inl:({∅} × V)–1-1-onto→V
7 f1ofun 5428 . . . . . . 7 (inl:({∅} × V)–1-1-onto→V → Fun inl)
86, 7ax-mp 5 . . . . . 6 Fun inl
9 funco 5222 . . . . . 6 ((Fun 𝐹 ∧ Fun inl) → Fun (𝐹inl))
103, 8, 9sylancl 410 . . . . 5 (𝜑 → Fun (𝐹inl))
11 dmco 5106 . . . . . . 7 dom (𝐹inl) = (inl “ dom 𝐹)
12 imacnvcnv 5062 . . . . . . 7 (inl “ dom 𝐹) = (inl “ dom 𝐹)
1311, 12eqtri 2185 . . . . . 6 dom (𝐹inl) = (inl “ dom 𝐹)
1413a1i 9 . . . . 5 (𝜑 → dom (𝐹inl) = (inl “ dom 𝐹))
15 df-fn 5185 . . . . 5 ((𝐹inl) Fn (inl “ dom 𝐹) ↔ (Fun (𝐹inl) ∧ dom (𝐹inl) = (inl “ dom 𝐹)))
1610, 14, 15sylanbrc 414 . . . 4 (𝜑 → (𝐹inl) Fn (inl “ dom 𝐹))
17 caseinr.g . . . . . . 7 (𝜑𝐺 Fn 𝐵)
18 fnfun 5279 . . . . . . 7 (𝐺 Fn 𝐵 → Fun 𝐺)
1917, 18syl 14 . . . . . 6 (𝜑 → Fun 𝐺)
20 djurf1o 7015 . . . . . . . 8 inr:V–1-1-onto→({1o} × V)
21 f1ocnv 5439 . . . . . . . 8 (inr:V–1-1-onto→({1o} × V) → inr:({1o} × V)–1-1-onto→V)
2220, 21ax-mp 5 . . . . . . 7 inr:({1o} × V)–1-1-onto→V
23 f1ofun 5428 . . . . . . 7 (inr:({1o} × V)–1-1-onto→V → Fun inr)
2422, 23ax-mp 5 . . . . . 6 Fun inr
25 funco 5222 . . . . . 6 ((Fun 𝐺 ∧ Fun inr) → Fun (𝐺inr))
2619, 24, 25sylancl 410 . . . . 5 (𝜑 → Fun (𝐺inr))
27 dmco 5106 . . . . . 6 dom (𝐺inr) = (inr “ dom 𝐺)
28 df-inr 7004 . . . . . . . . . . 11 inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
2928funmpt2 5221 . . . . . . . . . 10 Fun inr
30 funrel 5199 . . . . . . . . . 10 (Fun inr → Rel inr)
3129, 30ax-mp 5 . . . . . . . . 9 Rel inr
32 dfrel2 5048 . . . . . . . . 9 (Rel inr ↔ inr = inr)
3331, 32mpbi 144 . . . . . . . 8 inr = inr
3433a1i 9 . . . . . . 7 (𝜑inr = inr)
35 fndm 5281 . . . . . . . 8 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
3617, 35syl 14 . . . . . . 7 (𝜑 → dom 𝐺 = 𝐵)
3734, 36imaeq12d 4941 . . . . . 6 (𝜑 → (inr “ dom 𝐺) = (inr “ 𝐵))
3827, 37syl5eq 2209 . . . . 5 (𝜑 → dom (𝐺inr) = (inr “ 𝐵))
39 df-fn 5185 . . . . 5 ((𝐺inr) Fn (inr “ 𝐵) ↔ (Fun (𝐺inr) ∧ dom (𝐺inr) = (inr “ 𝐵)))
4026, 38, 39sylanbrc 414 . . . 4 (𝜑 → (𝐺inr) Fn (inr “ 𝐵))
41 djuin 7020 . . . . 5 ((inl “ dom 𝐹) ∩ (inr “ 𝐵)) = ∅
4241a1i 9 . . . 4 (𝜑 → ((inl “ dom 𝐹) ∩ (inr “ 𝐵)) = ∅)
43 caseinr.a . . . . . . . 8 (𝜑𝐴𝐵)
4443elexd 2734 . . . . . . 7 (𝜑𝐴 ∈ V)
45 f1odm 5430 . . . . . . . 8 (inr:V–1-1-onto→({1o} × V) → dom inr = V)
4620, 45ax-mp 5 . . . . . . 7 dom inr = V
4744, 46eleqtrrdi 2258 . . . . . 6 (𝜑𝐴 ∈ dom inr)
4847, 29jctil 310 . . . . 5 (𝜑 → (Fun inr ∧ 𝐴 ∈ dom inr))
49 funfvima 5710 . . . . 5 ((Fun inr ∧ 𝐴 ∈ dom inr) → (𝐴𝐵 → (inr‘𝐴) ∈ (inr “ 𝐵)))
5048, 43, 49sylc 62 . . . 4 (𝜑 → (inr‘𝐴) ∈ (inr “ 𝐵))
51 fvun2 5547 . . . 4 (((𝐹inl) Fn (inl “ dom 𝐹) ∧ (𝐺inr) Fn (inr “ 𝐵) ∧ (((inl “ dom 𝐹) ∩ (inr “ 𝐵)) = ∅ ∧ (inr‘𝐴) ∈ (inr “ 𝐵))) → (((𝐹inl) ∪ (𝐺inr))‘(inr‘𝐴)) = ((𝐺inr)‘(inr‘𝐴)))
5216, 40, 42, 50, 51syl112anc 1231 . . 3 (𝜑 → (((𝐹inl) ∪ (𝐺inr))‘(inr‘𝐴)) = ((𝐺inr)‘(inr‘𝐴)))
532, 52syl5eq 2209 . 2 (𝜑 → (case(𝐹, 𝐺)‘(inr‘𝐴)) = ((𝐺inr)‘(inr‘𝐴)))
54 f1ofn 5427 . . . 4 (inr:({1o} × V)–1-1-onto→V → inr Fn ({1o} × V))
5522, 54ax-mp 5 . . 3 inr Fn ({1o} × V)
56 f1of 5426 . . . . . 6 (inr:V–1-1-onto→({1o} × V) → inr:V⟶({1o} × V))
5720, 56ax-mp 5 . . . . 5 inr:V⟶({1o} × V)
5857a1i 9 . . . 4 (𝜑 → inr:V⟶({1o} × V))
5958, 44ffvelrnd 5615 . . 3 (𝜑 → (inr‘𝐴) ∈ ({1o} × V))
60 fvco2 5549 . . 3 ((inr Fn ({1o} × V) ∧ (inr‘𝐴) ∈ ({1o} × V)) → ((𝐺inr)‘(inr‘𝐴)) = (𝐺‘(inr‘(inr‘𝐴))))
6155, 59, 60sylancr 411 . 2 (𝜑 → ((𝐺inr)‘(inr‘𝐴)) = (𝐺‘(inr‘(inr‘𝐴))))
62 f1ocnvfv1 5739 . . . 4 ((inr:V–1-1-onto→({1o} × V) ∧ 𝐴 ∈ V) → (inr‘(inr‘𝐴)) = 𝐴)
6320, 44, 62sylancr 411 . . 3 (𝜑 → (inr‘(inr‘𝐴)) = 𝐴)
6463fveq2d 5484 . 2 (𝜑 → (𝐺‘(inr‘(inr‘𝐴))) = (𝐺𝐴))
6553, 61, 643eqtrd 2201 1 (𝜑 → (case(𝐹, 𝐺)‘(inr‘𝐴)) = (𝐺𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1342  wcel 2135  Vcvv 2721  cun 3109  cin 3110  c0 3404  {csn 3570  cop 3573   × cxp 4596  ccnv 4597  dom cdm 4598  cima 4601  ccom 4602  Rel wrel 4603  Fun wfun 5176   Fn wfn 5177  wf 5178  1-1-ontowf1o 5181  cfv 5182  1oc1o 6368  inlcinl 7001  inrcinr 7002  casecdjucase 7039
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1434  ax-7 1435  ax-gen 1436  ax-ie1 1480  ax-ie2 1481  ax-8 1491  ax-10 1492  ax-11 1493  ax-i12 1494  ax-bndl 1496  ax-4 1497  ax-17 1513  ax-i9 1517  ax-ial 1521  ax-i5r 1522  ax-13 2137  ax-14 2138  ax-ext 2146  ax-sep 4094  ax-nul 4102  ax-pow 4147  ax-pr 4181  ax-un 4405
This theorem depends on definitions:  df-bi 116  df-3an 969  df-tru 1345  df-fal 1348  df-nf 1448  df-sb 1750  df-eu 2016  df-mo 2017  df-clab 2151  df-cleq 2157  df-clel 2160  df-nfc 2295  df-ne 2335  df-ral 2447  df-rex 2448  df-v 2723  df-sbc 2947  df-dif 3113  df-un 3115  df-in 3117  df-ss 3124  df-nul 3405  df-pw 3555  df-sn 3576  df-pr 3577  df-op 3579  df-uni 3784  df-br 3977  df-opab 4038  df-mpt 4039  df-tr 4075  df-id 4265  df-iord 4338  df-on 4340  df-suc 4343  df-xp 4604  df-rel 4605  df-cnv 4606  df-co 4607  df-dm 4608  df-rn 4609  df-res 4610  df-ima 4611  df-iota 5147  df-fun 5184  df-fn 5185  df-f 5186  df-f1 5187  df-fo 5188  df-f1o 5189  df-fv 5190  df-1st 6100  df-2nd 6101  df-1o 6375  df-inl 7003  df-inr 7004  df-case 7040
This theorem is referenced by:  omp1eomlem  7050
  Copyright terms: Public domain W3C validator