homadmcd - Metamath Proof Explorer

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

Theorem homadmcd 18137

Description: Decompose an arrow into domain, codomain, and morphism. (Contributed by Mario Carneiro, 11-Jan-2017.)

**Hypothesis**
Ref	Expression
homahom.h	⊢ 𝐻 = (Hom_a‘𝐶)

**Assertion**
Ref	Expression
homadmcd	⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2^nd ‘𝐹)⟩)

**Proof of Theorem homadmcd**
Step	Hyp	Ref	Expression
1		homahom.h	. . . . 5 ⊢ 𝐻 = (Hom_a‘𝐶)
2	1	homarel 18131	. . . 4 ⊢ Rel (𝑋𝐻𝑌)
3		1st2nd 8040	. . . 4 ⊢ ((Rel (𝑋𝐻𝑌) ∧ 𝐹 ∈ (𝑋𝐻𝑌)) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
4	2, 3	mpan 703	. . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
5		1st2ndbr 8043	. . . . . 6 ⊢ ((Rel (𝑋𝐻𝑌) ∧ 𝐹 ∈ (𝑋𝐻𝑌)) → (1^st ‘𝐹)(𝑋𝐻𝑌)(2^nd ‘𝐹))
6	2, 5	mpan 703	. . . . 5 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (1^st ‘𝐹)(𝑋𝐻𝑌)(2^nd ‘𝐹))
7	1	homa1 18132	. . . . 5 ⊢ ((1^st ‘𝐹)(𝑋𝐻𝑌)(2^nd ‘𝐹) → (1^st ‘𝐹) = ⟨𝑋, 𝑌⟩)
8	6, 7	syl 18	. . . 4 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (1^st ‘𝐹) = ⟨𝑋, 𝑌⟩)
9	8	opeq1d 4842	. . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩ = ⟨⟨𝑋, 𝑌⟩, (2^nd ‘𝐹)⟩)
10	4, 9	eqtrd 2797	. 2 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨⟨𝑋, 𝑌⟩, (2^nd ‘𝐹)⟩)
11		df-ot 4596	. 2 ⊢ ⟨𝑋, 𝑌, (2^nd ‘𝐹)⟩ = ⟨⟨𝑋, 𝑌⟩, (2^nd ‘𝐹)⟩
12	10, 11	eqtr4di 2815	1 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2^nd ‘𝐹)⟩)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⟨cop 4593 ⟨cotp 4595 class class class wbr 5107 Rel wrel 5664 ‘cfv 6537 (class class class)co 7417 1^st c1st 7988 2^nd c2nd 7989 Hom_achoma 18118

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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740

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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-ot 4596 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-1st 7990 df-2nd 7991 df-homa 18121

This theorem is used by: arwdmcd 18147 arwlid 18167 arwrid 18168

W3C validator