Theorem swapfida 50357

Description: Each identity morphism in the source category is mapped to the corresponding identity morphism in the target category. See also swapfid 50356. (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 2761	. . . . . . 7 ⊢ (Base‘𝐶) = (Base‘𝐶)
9		eqid 2761	. . . . . . 7 ⊢ (Base‘𝐷) = (Base‘𝐷)
10	3, 8, 9	xpcbas 18345	. . . . . 6 ⊢ ((Base‘𝐶) × (Base‘𝐷)) = (Base‘𝑆)
11	7, 10	eqtr4i 2787	. . . . 5 ⊢ 𝐵 = ((Base‘𝐶) × (Base‘𝐷))
12	6, 11	eleqtrdi 2871	. . . 4 ⊢ (𝜑 → 𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)))
13		xp1st 8031	. . . 4 ⊢ (𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)) → (1st ‘𝑋) ∈ (Base‘𝐶))
14	12, 13	syl 18	. . 3 ⊢ (𝜑 → (1st ‘𝑋) ∈ (Base‘𝐶))
15		xp2nd 8032	. . . 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 50356	. 2 ⊢ (𝜑 → ((⟨(1st ‘𝑋), (2nd ‘𝑋)⟩𝑃⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)‘( 1 ‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)) = (𝐼‘(𝑂‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)))
20		1st2nd2 8038	. . . . 5 ⊢ (𝑋 ∈ ((Base‘𝐶) × (Base‘𝐷)) → 𝑋 = ⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)
21	12, 20	syl 18	. . . 4 ⊢ (𝜑 → 𝑋 = ⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)
22	21, 21	oveq12d 7436	. . 3 ⊢ (𝜑 → (𝑋𝑃𝑋) = (⟨(1st ‘𝑋), (2nd ‘𝑋)⟩𝑃⟨(1st ‘𝑋), (2nd ‘𝑋)⟩))
23	21	fveq2d 6887	. . 3 ⊢ (𝜑 → ( 1 ‘𝑋) = ( 1 ‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩))
24	22, 23	fveq12d 6890	. 2 ⊢ (𝜑 → ((𝑋𝑃𝑋)‘( 1 ‘𝑋)) = ((⟨(1st ‘𝑋), (2nd ‘𝑋)⟩𝑃⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)‘( 1 ‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)))
25	21	fveq2d 6887	. . 3 ⊢ (𝜑 → (𝑂‘𝑋) = (𝑂‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩))
26	25	fveq2d 6887	. 2 ⊢ (𝜑 → (𝐼‘(𝑂‘𝑋)) = (𝐼‘(𝑂‘⟨(1st ‘𝑋), (2nd ‘𝑋)⟩)))
27	19, 24, 26	3eqtr4d 2806	1 ⊢ (𝜑 → ((𝑋𝑃𝑋)‘( 1 ‘𝑋)) = (𝐼‘(𝑂‘𝑋)))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  ⟨cop 4590   × cxp 5649  ‘cfv 6537  (class class class)co 7418  1^st c1st 7997  2^nd c2nd 7998  Basecbs 17380  Catccat 17831  Idccid 17832   ×_c cxpc 18335   swap_F cswapf 50336

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 7749  ax-cnex 11249  ax-resscn 11250  ax-1cn 11251  ax-icn 11252  ax-addcl 11253  ax-addrcl 11254  ax-mulcl 11255  ax-mulrcl 11256  ax-mulcom 11257  ax-addass 11258  ax-mulass 11259  ax-distr 11260  ax-i2m1 11261  ax-1ne0 11262  ax-1rid 11263  ax-rnegex 11264  ax-rrecex 11265  ax-cnre 11266  ax-pre-lttri 11267  ax-pre-lttrn 11268  ax-pre-ltadd 11269  ax-pre-mulgt0 11270

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  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-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 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  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-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  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-riota 7375  df-ov 7421  df-oprab 7422  df-mpo 7423  df-om 7876  df-1st 7999  df-2nd 8000  df-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-1o 8469  df-er 8710  df-en 8967  df-dom 8968  df-sdom 8969  df-fin 8970  df-pnf 11338  df-mnf 11339  df-xr 11340  df-ltxr 11341  df-le 11342  df-sub 11536  df-neg 11537  df-nn 12329  df-2 12398  df-3 12399  df-4 12400  df-5 12401  df-6 12402  df-7 12403  df-8 12404  df-9 12405  df-n0 12600  df-z 12687  df-dec 12808  df-uz 12959  df-fz 13633  df-struct 17318  df-slot 17353  df-ndx 17365  df-base 17381  df-hom 17445  df-cco 17446  df-cat 17835  df-cid 17836  df-xpc 18339  df-swapf 50337

This theorem is used by:  swapffunc  50359