Theorem swapfida 50206

Description: Each identity morphism in the source category is mapped to the corresponding identity morphism in the target category. See also swapfid 50205. (Contributed by Zhi Wang, 8-Oct-2025.)

Hypotheses

Ref	Expression
swapfid.c	⊢ (𝜑 → 𝐶 ∈ Cat)
swapfid.d	⊢ (𝜑 → 𝐷 ∈ Cat)
swapfid.s	⊢ 𝑆 = (𝐶 ×c 𝐷)
swapfid.t	⊢ 𝑇 = (𝐷 ×c 𝐶)
swapfid.o	⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
swapfida.b	⊢ 𝐵 = (Base‘𝑆)
swapfida.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
swapfida.1	⊢ 1 = (Id‘𝑆)
swapfida.i	⊢ 𝐼 = (Id‘𝑇)

Assertion

Ref	Expression
swapfida	⊢ (𝜑 → ((𝑋𝑃𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝑂‘𝑋)))

Proof of Theorem swapfida

Step	Hyp	Ref	Expression
1		swapfid.c	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
2		swapfid.d	. . 3 ⊢ (𝜑 → 𝐷 ∈ Cat)
3		swapfid.s	. . 3 ⊢ 𝑆 = (𝐶 ×c 𝐷)
4		swapfid.t	. . 3 ⊢ 𝑇 = (𝐷 ×c 𝐶)
5		swapfid.o	. . 3 ⊢ (𝜑 → (𝐶 swapF 𝐷) = ⟨𝑂, 𝑃⟩)
6		swapfida.x	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
7		swapfida.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑆)
8		eqid 2760	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
9		eqid 2760	. . . . . . 7 ⊢ (Base‘𝐷) = (Base‘𝐷)
10	3, 8, 9	xpcbas 18266	. . . . . 6 ⊢ ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑆)
11	7, 10	eqtr4i 2786	. . . . 5 ⊢ 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
12	6, 11	eleqtrdi 2870	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)))
13		xp1st 8018	. . . 4 ⊢ (𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)) → (1st ‘𝑋) ∈ (Base‘𝐶))
14	12, 13	syl 18	. . 3 ⊢ (𝜑 → (1st ‘𝑋) ∈ (Base‘𝐶))
15		xp2nd 8019	. . . 4 ⊢ (𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)) → (2nd ‘𝑋) ∈ (Base‘𝐷))
16	12, 15	syl 18	. . 3 ⊢ (𝜑 → (2nd ‘𝑋) ∈ (Base‘𝐷))
17		swapfida.1	. . 3 ⊢ 1 = (Id‘𝑆)
18		swapfida.i	. . 3 ⊢ 𝐼 = (Id‘𝑇)
19	1, 2, 3, 4, 5, 14, 16, 17, 18	swapfid 50205	. 2 ⊢ (𝜑 → ((⟨(1st ‘𝑋), (2nd ‘𝑋)⟩𝑃⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)‘( 1 ‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)) = (𝐼‘(𝑂‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)))
20		1st2nd2 8025	. . . . 5 ⊢ (𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)) → 𝑋 = ⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)
21	12, 20	syl 18	. . . 4 ⊢ (𝜑 → 𝑋 = ⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)
22	21, 21	oveq12d 7431	. . 3 ⊢ (𝜑 → (𝑋𝑃𝑋) = (⟨(1st ‘𝑋), (2nd ‘𝑋)⟩𝑃⟨(1st ‘𝑋), (2nd ‘𝑋)⟩))
23	21	fveq2d 6882	. . 3 ⊢ (𝜑 → ( 1 ‘𝑋) = ( 1 ‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩))
24	22, 23	fveq12d 6885	. 2 ⊢ (𝜑 → ((𝑋𝑃𝑋)‘( 1 ‘𝑋)) = ((⟨(1st ‘𝑋), (2nd ‘𝑋)⟩𝑃⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)‘( 1 ‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)))
25	21	fveq2d 6882	. . 3 ⊢ (𝜑 → (𝑂‘𝑋) = (𝑂‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩))
26	25	fveq2d 6882	. 2 ⊢ (𝜑 → (𝐼‘(𝑂‘𝑋)) = (𝐼‘(𝑂‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)))
27	19, 24, 26	3eqtr4d 2805	1 ⊢ (𝜑 → ((𝑋𝑃𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝑂‘𝑋)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   × cxp 5653  ‘cfv 6533  (class class class)co 7413  1^st c1st 7984  2^nd c2nd 7985  Basecbs 17301  Catccat 17752  Idccid 17753   ×_c cxpc 18256   swap_F cswapf 50185

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 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-mulcom 11188  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200  ax-pre-mulgt0 11201

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-sub 11467  df-neg 11468  df-nn 12258  df-2 12327  df-3 12328  df-4 12329  df-5 12330  df-6 12331  df-7 12332  df-8 12333  df-9 12334  df-n0 12529  df-z 12616  df-dec 12737  df-uz 12888  df-fz 13562  df-struct 17239  df-slot 17274  df-ndx 17286  df-base 17302  df-hom 17366  df-cco 17367  df-cat 17756  df-cid 17757  df-xpc 18260  df-swapf 50186

This theorem is used by:  swapffunc  50208