ida2 - Metamath Proof Explorer

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

Theorem ida2 18077

Description: Morphism part of the identity arrow. (Contributed by Mario Carneiro, 11-Jan-2017.)

**Hypotheses**
Ref	Expression
idafval.i	⊢ 𝐼 = (Id_a‘𝐶)
idafval.b	⊢ 𝐵 = (Base‘𝐶)
idafval.c	⊢ (𝜑 → 𝐶 ∈ Cat)
idafval.1	⊢ 1 = (Id‘𝐶)
idaval.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)

**Assertion**
Ref	Expression
ida2	⊢ (𝜑 → (2^nd ‘(𝐼‘𝑋)) = ( 1 ‘𝑋))

**Proof of Theorem ida2**
Step	Hyp	Ref	Expression
1		idafval.i	. . . 4 ⊢ 𝐼 = (Id_a‘𝐶)
2		idafval.b	. . . 4 ⊢ 𝐵 = (Base‘𝐶)
3		idafval.c	. . . 4 ⊢ (𝜑 → 𝐶 ∈ Cat)
4		idafval.1	. . . 4 ⊢ 1 = (Id‘𝐶)
5		idaval.x	. . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
6	1, 2, 3, 4, 5	idaval 18076	. . 3 ⊢ (𝜑 → (𝐼‘𝑋) = ⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩)
7	6	fveq2d 6885	. 2 ⊢ (𝜑 → (2^nd ‘(𝐼‘𝑋)) = (2^nd ‘⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩))
8		fvex 6894	. . 3 ⊢ ( 1 ‘𝑋) ∈ V
9		ot3rdg 8009	. . 3 ⊢ (( 1 ‘𝑋) ∈ V → (2^nd ‘⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩) = ( 1 ‘𝑋))
10	8, 9	ax-mp 5	. 2 ⊢ (2^nd ‘⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩) = ( 1 ‘𝑋)
11	7, 10	eqtrdi 2787	1 ⊢ (𝜑 → (2^nd ‘(𝐼‘𝑋)) = ( 1 ‘𝑋))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 Vcvv 3464 ⟨cotp 4614 ‘cfv 6536 2^nd c2nd 7992 Basecbs 17233 Catccat 17681 Idccid 17682 Id_acida 18071

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-rep 5254 ax-sep 5271 ax-nul 5281 ax-pr 5407 ax-un 7734

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-ot 4615 df-uni 4889 df-iun 4974 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 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 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-2nd 7994 df-ida 18073

This theorem is referenced by: arwlid 18090 arwrid 18091

W3C validator