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 18284

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 18283	. . 3 ⊢ (𝜑 → (𝐼‘𝑋) = ⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩)
7	6	fveq2d 6920	. 2 ⊢ (𝜑 → (2^nd ‘(𝐼‘𝑋)) = (2^nd ‘⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩))
8		fvex 6929	. . 3 ⊢ ( 1 ‘𝑋) ∈ V
9		ot3rdg 8051	. . 3 ⊢ (( 1 ‘𝑋) ∈ V → (2^nd ‘⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩) = ( 1 ‘𝑋))
10	8, 9	ax-mp 5	. 2 ⊢ (2^nd ‘⟨𝑋, 𝑋, ( 1 ‘𝑋)⟩) = ( 1 ‘𝑋)
11	7, 10	eqtrdi 2814	1 ⊢ (𝜑 → (2^nd ‘(𝐼‘𝑋)) = ( 1 ‘𝑋))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ⟨cotp 4863 ‘cfv 6566 2^nd c2nd 8034 Basecbs 17431 Catccat 17888 Idccid 17889 Id_acida 18278

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-rep 5238 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-reu 3370 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-ot 4864 df-uni 4873 df-iun 4958 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-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-2nd 8036 df-ida 18280

This theorem is used by: arwlid 18297 arwrid 18298

W3C validator