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

Theorem caseinr 7351
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 7343 . . . 4 case(𝐹, 𝐺) = ((𝐹inl) ∪ (𝐺inr))
21fveq1i 5649 . . 3 (case(𝐹, 𝐺)‘(inr‘𝐴)) = (((𝐹inl) ∪ (𝐺inr))‘(inr‘𝐴))
3 caseinr.f . . . . . 6 (𝜑 → Fun 𝐹)
4 djulf1o 7317 . . . . . . . 8 inl:V–1-1-onto→({∅} × V)
5 f1ocnv 5605 . . . . . . . 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 5594 . . . . . . 7 (inl:({∅} × V)–1-1-onto→V → Fun inl)
86, 7ax-mp 5 . . . . . 6 Fun inl
9 funco 5373 . . . . . 6 ((Fun 𝐹 ∧ Fun inl) → Fun (𝐹inl))
103, 8, 9sylancl 413 . . . . 5 (𝜑 → Fun (𝐹inl))
11 dmco 5252 . . . . . . 7 dom (𝐹inl) = (inl “ dom 𝐹)
12 imacnvcnv 5208 . . . . . . 7 (inl “ dom 𝐹) = (inl “ dom 𝐹)
1311, 12eqtri 2252 . . . . . 6 dom (𝐹inl) = (inl “ dom 𝐹)
1413a1i 9 . . . . 5 (𝜑 → dom (𝐹inl) = (inl “ dom 𝐹))
15 df-fn 5336 . . . . 5 ((𝐹inl) Fn (inl “ dom 𝐹) ↔ (Fun (𝐹inl) ∧ dom (𝐹inl) = (inl “ dom 𝐹)))
1610, 14, 15sylanbrc 417 . . . 4 (𝜑 → (𝐹inl) Fn (inl “ dom 𝐹))
17 caseinr.g . . . . . . 7 (𝜑𝐺 Fn 𝐵)
18 fnfun 5434 . . . . . . 7 (𝐺 Fn 𝐵 → Fun 𝐺)
1917, 18syl 14 . . . . . 6 (𝜑 → Fun 𝐺)
20 djurf1o 7318 . . . . . . . 8 inr:V–1-1-onto→({1o} × V)
21 f1ocnv 5605 . . . . . . . 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 5594 . . . . . . 7 (inr:({1o} × V)–1-1-onto→V → Fun inr)
2422, 23ax-mp 5 . . . . . 6 Fun inr
25 funco 5373 . . . . . 6 ((Fun 𝐺 ∧ Fun inr) → Fun (𝐺inr))
2619, 24, 25sylancl 413 . . . . 5 (𝜑 → Fun (𝐺inr))
27 dmco 5252 . . . . . 6 dom (𝐺inr) = (inr “ dom 𝐺)
28 df-inr 7307 . . . . . . . . . . 11 inr = (𝑥 ∈ V ↦ ⟨1o, 𝑥⟩)
2928funmpt2 5372 . . . . . . . . . 10 Fun inr
30 funrel 5350 . . . . . . . . . 10 (Fun inr → Rel inr)
3129, 30ax-mp 5 . . . . . . . . 9 Rel inr
32 dfrel2 5194 . . . . . . . . 9 (Rel inr ↔ inr = inr)
3331, 32mpbi 145 . . . . . . . 8 inr = inr
3433a1i 9 . . . . . . 7 (𝜑inr = inr)
35 fndm 5436 . . . . . . . 8 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
3617, 35syl 14 . . . . . . 7 (𝜑 → dom 𝐺 = 𝐵)
3734, 36imaeq12d 5083 . . . . . 6 (𝜑 → (inr “ dom 𝐺) = (inr “ 𝐵))
3827, 37eqtrid 2276 . . . . 5 (𝜑 → dom (𝐺inr) = (inr “ 𝐵))
39 df-fn 5336 . . . . 5 ((𝐺inr) Fn (inr “ 𝐵) ↔ (Fun (𝐺inr) ∧ dom (𝐺inr) = (inr “ 𝐵)))
4026, 38, 39sylanbrc 417 . . . 4 (𝜑 → (𝐺inr) Fn (inr “ 𝐵))
41 djuin 7323 . . . . 5 ((inl “ dom 𝐹) ∩ (inr “ 𝐵)) = ∅
4241a1i 9 . . . 4 (𝜑 → ((inl “ dom 𝐹) ∩ (inr “ 𝐵)) = ∅)
43 caseinr.a . . . . . . . 8 (𝜑𝐴𝐵)
4443elexd 2817 . . . . . . 7 (𝜑𝐴 ∈ V)
45 f1odm 5596 . . . . . . . 8 (inr:V–1-1-onto→({1o} × V) → dom inr = V)
4620, 45ax-mp 5 . . . . . . 7 dom inr = V
4744, 46eleqtrrdi 2325 . . . . . 6 (𝜑𝐴 ∈ dom inr)
4847, 29jctil 312 . . . . 5 (𝜑 → (Fun inr ∧ 𝐴 ∈ dom inr))
49 funfvima 5896 . . . . 5 ((Fun inr ∧ 𝐴 ∈ dom inr) → (𝐴𝐵 → (inr‘𝐴) ∈ (inr “ 𝐵)))
5048, 43, 49sylc 62 . . . 4 (𝜑 → (inr‘𝐴) ∈ (inr “ 𝐵))
51 fvun2 5722 . . . 4 (((𝐹inl) Fn (inl “ dom 𝐹) ∧ (𝐺inr) Fn (inr “ 𝐵) ∧ (((inl “ dom 𝐹) ∩ (inr “ 𝐵)) = ∅ ∧ (inr‘𝐴) ∈ (inr “ 𝐵))) → (((𝐹inl) ∪ (𝐺inr))‘(inr‘𝐴)) = ((𝐺inr)‘(inr‘𝐴)))
5216, 40, 42, 50, 51syl112anc 1278 . . 3 (𝜑 → (((𝐹inl) ∪ (𝐺inr))‘(inr‘𝐴)) = ((𝐺inr)‘(inr‘𝐴)))
532, 52eqtrid 2276 . 2 (𝜑 → (case(𝐹, 𝐺)‘(inr‘𝐴)) = ((𝐺inr)‘(inr‘𝐴)))
54 f1ofn 5593 . . . 4 (inr:({1o} × V)–1-1-onto→V → inr Fn ({1o} × V))
5522, 54ax-mp 5 . . 3 inr Fn ({1o} × V)
56 f1of 5592 . . . . . 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, 44ffvelcdmd 5791 . . 3 (𝜑 → (inr‘𝐴) ∈ ({1o} × V))
60 fvco2 5724 . . 3 ((inr Fn ({1o} × V) ∧ (inr‘𝐴) ∈ ({1o} × V)) → ((𝐺inr)‘(inr‘𝐴)) = (𝐺‘(inr‘(inr‘𝐴))))
6155, 59, 60sylancr 414 . 2 (𝜑 → ((𝐺inr)‘(inr‘𝐴)) = (𝐺‘(inr‘(inr‘𝐴))))
62 f1ocnvfv1 5928 . . . 4 ((inr:V–1-1-onto→({1o} × V) ∧ 𝐴 ∈ V) → (inr‘(inr‘𝐴)) = 𝐴)
6320, 44, 62sylancr 414 . . 3 (𝜑 → (inr‘(inr‘𝐴)) = 𝐴)
6463fveq2d 5652 . 2 (𝜑 → (𝐺‘(inr‘(inr‘𝐴))) = (𝐺𝐴))
6553, 61, 643eqtrd 2268 1 (𝜑 → (case(𝐹, 𝐺)‘(inr‘𝐴)) = (𝐺𝐴))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2202  Vcvv 2803  cun 3199  cin 3200  c0 3496  {csn 3673  cop 3676   × cxp 4729  ccnv 4730  dom cdm 4731  cima 4734  ccom 4735  Rel wrel 4736  Fun wfun 5327   Fn wfn 5328  wf 5329  1-1-ontowf1o 5332  cfv 5333  1oc1o 6618  inlcinl 7304  inrcinr 7305  casecdjucase 7342
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 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  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-ne 2404  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  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-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-2nd 6313  df-1o 6625  df-inl 7306  df-inr 7307  df-case 7343
This theorem is referenced by:  omp1eomlem  7353
  Copyright terms: Public domain W3C validator