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 18197

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 18191	. . . 4 ⊢ Rel (𝑋𝐻𝑌)
3		1st2nd 8039	. . . 4 ⊢ ((Rel (𝑋𝐻𝑌) ∧ 𝐹 ∈ (𝑋𝐻𝑌)) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
4	2, 3	mpan 703	. . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩)
5		1st2ndbr 8042	. . . . . 6 ⊢ ((Rel (𝑋𝐻𝑌) ∧ 𝐹 ∈ (𝑋𝐻𝑌)) → (1^st ‘𝐹)(𝑋𝐻𝑌)(2^nd ‘𝐹))
6	2, 5	mpan 703	. . . . 5 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (1^st ‘𝐹)(𝑋𝐻𝑌)(2^nd ‘𝐹))
7	1	homa1 18192	. . . . 5 ⊢ ((1^st ‘𝐹)(𝑋𝐻𝑌)(2^nd ‘𝐹) → (1^st ‘𝐹) = ⟨𝑋, 𝑌⟩)
8	6, 7	syl 18	. . . 4 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → (1^st ‘𝐹) = ⟨𝑋, 𝑌⟩)
9	8	opeq1d 4839	. . 3 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → ⟨(1^st ‘𝐹), (2^nd ‘𝐹)⟩ = ⟨⟨𝑋, 𝑌⟩, (2^nd ‘𝐹)⟩)
10	4, 9	eqtrd 2796	. 2 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨⟨𝑋, 𝑌⟩, (2^nd ‘𝐹)⟩)
11		df-ot 4593	. 2 ⊢ ⟨𝑋, 𝑌, (2^nd ‘𝐹)⟩ = ⟨⟨𝑋, 𝑌⟩, (2^nd ‘𝐹)⟩
12	10, 11	eqtr4di 2814	1 ⊢ (𝐹 ∈ (𝑋𝐻𝑌) → 𝐹 = ⟨𝑋, 𝑌, (2^nd ‘𝐹)⟩)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⟨cop 4590 ⟨cotp 4592 class class class wbr 5103 Rel wrel 5656 ‘cfv 6531 (class class class)co 7412 1^st c1st 7988 2^nd c2nd 7989 Hom_achoma 18178

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 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-ot 4593 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-ov 7415 df-1st 7990 df-2nd 7991 df-homa 18181

This theorem is used by: arwdmcd 18207 arwlid 18227 arwrid 18228

W3C validator