MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  updjudhcoinlf Structured version   Visualization version   GIF version

Theorem updjudhcoinlf 10050
Description: The composition of the mapping of an element of the disjoint union to the value of the corresponding function and the left injection equals the first function. (Contributed by AV, 27-Jun-2022.)
Hypotheses
Ref Expression
updjud.f (𝜑 → 𝐹:𝐴⟶𝐶)
updjud.g (𝜑 → 𝐺:𝐵⟶𝐶)
updjudhf.h 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))
Assertion
Ref Expression
updjudhcoinlf (𝜑 → (𝐻 ∘ (inl ↾ 𝐴)) = 𝐹)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶   𝜑,𝑥   𝑥,𝐹
Allowed substitution hints:   𝐺(𝑥)   𝐻(𝑥)

Proof of Theorem updjudhcoinlf
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 updjud.f . . . . 5 (𝜑 → 𝐹:𝐴⟶𝐶)
2 updjud.g . . . . 5 (𝜑 → 𝐺:𝐵⟶𝐶)
3 updjudhf.h . . . . 5 𝐻 = (𝑥 ∈ (𝐴 ⊔ 𝐵) ↦ if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))))
41, 2, 3updjudhf 10049 . . . 4 (𝜑 → 𝐻:(𝐴 ⊔ 𝐵)⟶𝐶)
54ffnd 6740 . . 3 (𝜑 → 𝐻 Fn (𝐴 ⊔ 𝐵))
6 inlresf 10032 . . . 4 (inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵)
7 ffn 6739 . . . 4 ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) → (inl ↾ 𝐴) Fn 𝐴)
86, 7mp1i 14 . . 3 (𝜑 → (inl ↾ 𝐴) Fn 𝐴)
9 frn 6747 . . . 4 ((inl ↾ 𝐴):𝐴⟶(𝐴 ⊔ 𝐵) → ran (inl ↾ 𝐴) ⊆ (𝐴 ⊔ 𝐵))
106, 9mp1i 14 . . 3 (𝜑 → ran (inl ↾ 𝐴) ⊆ (𝐴 ⊔ 𝐵))
11 fnco 6687 . . 3 ((𝐻 Fn (𝐴 ⊔ 𝐵) ∧ (inl ↾ 𝐴) Fn 𝐴 ∧ ran (inl ↾ 𝐴) ⊆ (𝐴 ⊔ 𝐵)) → (𝐻 ∘ (inl ↾ 𝐴)) Fn 𝐴)
125, 8, 10, 11syl3anc 1399 . 2 (𝜑 → (𝐻 ∘ (inl ↾ 𝐴)) Fn 𝐴)
131ffnd 6740 . 2 (𝜑 → 𝐹 Fn 𝐴)
14 fvco2 7013 . . . 4 (((inl ↾ 𝐴) Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → ((𝐻 ∘ (inl ↾ 𝐴))‘𝑎) = (𝐻‘((inl ↾ 𝐴)‘𝑎)))
158, 14sylan 592 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝐻 ∘ (inl ↾ 𝐴))‘𝑎) = (𝐻‘((inl ↾ 𝐴)‘𝑎)))
16 fvres 6935 . . . . . 6 (𝑎 ∈ 𝐴 → ((inl ↾ 𝐴)‘𝑎) = (inl‘𝑎))
1716adantl 487 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((inl ↾ 𝐴)‘𝑎) = (inl‘𝑎))
1817fveq2d 6920 . . . 4 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐻‘((inl ↾ 𝐴)‘𝑎)) = (𝐻‘(inl‘𝑎)))
19 fveqeq2 6925 . . . . . . . 8 (𝑥 = (inl‘𝑎) → ((1st ‘𝑥) = ∅ ↔ (1st ‘(inl‘𝑎)) = ∅))
20 2fveq3 6921 . . . . . . . 8 (𝑥 = (inl‘𝑎) → (𝐹‘(2nd ‘𝑥)) = (𝐹‘(2nd ‘(inl‘𝑎))))
21 2fveq3 6921 . . . . . . . 8 (𝑥 = (inl‘𝑎) → (𝐺‘(2nd ‘𝑥)) = (𝐺‘(2nd ‘(inl‘𝑎))))
2219, 20, 21ifbieq12d 4514 . . . . . . 7 (𝑥 = (inl‘𝑎) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = if((1st ‘(inl‘𝑎)) = ∅, (𝐹‘(2nd ‘(inl‘𝑎))), (𝐺‘(2nd ‘(inl‘𝑎)))))
2322adantl 487 . . . . . 6 (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = if((1st ‘(inl‘𝑎)) = ∅, (𝐹‘(2nd ‘(inl‘𝑎))), (𝐺‘(2nd ‘(inl‘𝑎)))))
24 1stinl 10045 . . . . . . . . 9 (𝑎 ∈ 𝐴 → (1st ‘(inl‘𝑎)) = ∅)
2524adantl 487 . . . . . . . 8 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (1st ‘(inl‘𝑎)) = ∅)
2625adantr 486 . . . . . . 7 (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → (1st ‘(inl‘𝑎)) = ∅)
2726iftrued 4493 . . . . . 6 (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → if((1st ‘(inl‘𝑎)) = ∅, (𝐹‘(2nd ‘(inl‘𝑎))), (𝐺‘(2nd ‘(inl‘𝑎)))) = (𝐹‘(2nd ‘(inl‘𝑎))))
2823, 27eqtrd 2798 . . . . 5 (((𝜑 ∧ 𝑎 ∈ 𝐴) ∧ 𝑥 = (inl‘𝑎)) → if((1st ‘𝑥) = ∅, (𝐹‘(2nd ‘𝑥)), (𝐺‘(2nd ‘𝑥))) = (𝐹‘(2nd ‘(inl‘𝑎))))
29 djulcl 10028 . . . . . 6 (𝑎 ∈ 𝐴 → (inl‘𝑎) ∈ (𝐴 ⊔ 𝐵))
3029adantl 487 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (inl‘𝑎) ∈ (𝐴 ⊔ 𝐵))
311adantr 486 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝐹:𝐴⟶𝐶)
32 2ndinl 10046 . . . . . . . 8 (𝑎 ∈ 𝐴 → (2nd ‘(inl‘𝑎)) = 𝑎)
3332adantl 487 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (2nd ‘(inl‘𝑎)) = 𝑎)
34 simpr 490 . . . . . . 7 ((𝜑 ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
3533, 34eqeltrd 2864 . . . . . 6 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (2nd ‘(inl‘𝑎)) ∈ 𝐴)
3631, 35ffvelcdmd 7117 . . . . 5 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘(2nd ‘(inl‘𝑎))) ∈ 𝐶)
373, 28, 30, 36fvmptd2 7033 . . . 4 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐻‘(inl‘𝑎)) = (𝐹‘(2nd ‘(inl‘𝑎))))
3818, 37eqtrd 2798 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐻‘((inl ↾ 𝐴)‘𝑎)) = (𝐹‘(2nd ‘(inl‘𝑎))))
3933fveq2d 6920 . . 3 ((𝜑 ∧ 𝑎 ∈ 𝐴) → (𝐹‘(2nd ‘(inl‘𝑎))) = (𝐹‘𝑎))
4015, 38, 393eqtrd 2802 . 2 ((𝜑 ∧ 𝑎 ∈ 𝐴) → ((𝐻 ∘ (inl ↾ 𝐴))‘𝑎) = (𝐹‘𝑎))
4112, 13, 40eqfnfvd 7063 1 (𝜑 → (𝐻 ∘ (inl ↾ 𝐴)) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∅c0 4281  ifcif 4485   ↦ cmpt 5192  ran crn 5659   ↾ cres 5660   ∘ ccom 5662   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034   ⊔ cdju 10016  inlcinl 10017
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-1st 8035  df-2nd 8036  df-1o 8514  df-dju 10019  df-inl 10020
This theorem is used by:  updjud  10052
  Copyright terms: Public domain W3C validator