Theorem isofn 17234

Description: The function value of the function returning the isomorphisms of a category is a function over the square product of the base set of the category. (Contributed by AV, 5-Apr-2020.)

Assertion

Ref	Expression
isofn	⊢ (𝐶 ∈ Cat → (Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))

Proof of Theorem isofn

Dummy variables 𝑐 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dmexg 7659	. . . . . 6 ⊢ (𝑥 ∈ V → dom 𝑥 ∈ V)
2	1	adantl 485	. . . . 5 ⊢ ((𝐶 ∈ Cat ∧ 𝑥 ∈ V) → dom 𝑥 ∈ V)
3	2	ralrimiva 3095	. . . 4 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ V dom 𝑥 ∈ V)
4		eqid 2736	. . . . 5 ⊢ (𝑥 ∈ V ↦ dom 𝑥) = (𝑥 ∈ V ↦ dom 𝑥)
5	4	fnmpt 6496	. . . 4 ⊢ (∀𝑥 ∈ V dom 𝑥 ∈ V → (𝑥 ∈ V ↦ dom 𝑥) Fn V)
6	3, 5	syl 17	. . 3 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ V ↦ dom 𝑥) Fn V)
7		ovex 7224	. . . . . . . 8 ⊢ (𝑥(Sect‘𝐶)𝑦) ∈ V
8	7	inex1 5195	. . . . . . 7 ⊢ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V
9	8	a1i 11	. . . . . 6 ⊢ ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V)
10	9	ralrimivva 3102	. . . . 5 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V)
11		eqid 2736	. . . . . 6 ⊢ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)))
12	11	fnmpo 7817	. . . . 5 ⊢ (∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) Fn ((Base‘𝐶) × (Base‘𝐶)))
13	10, 12	syl 17	. . . 4 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) Fn ((Base‘𝐶) × (Base‘𝐶)))
14		df-inv 17207	. . . . . 6 ⊢ Inv = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))))
15		fveq2 6695	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
16		fveq2 6695	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (Sect‘𝑐) = (Sect‘𝐶))
17	16	oveqd 7208	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → (𝑥(Sect‘𝑐)𝑦) = (𝑥(Sect‘𝐶)𝑦))
18	16	oveqd 7208	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (𝑦(Sect‘𝑐)𝑥) = (𝑦(Sect‘𝐶)𝑥))
19	18	cnveqd 5729	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → ◡(𝑦(Sect‘𝑐)𝑥) = ◡(𝑦(Sect‘𝐶)𝑥))
20	17, 19	ineq12d 4114	. . . . . . 7 ⊢ (𝑐 = 𝐶 → ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥)) = ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)))
21	15, 15, 20	mpoeq123dv 7264	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))))
22		id 22	. . . . . 6 ⊢ (𝐶 ∈ Cat → 𝐶 ∈ Cat)
23		fvex 6708	. . . . . . . 8 ⊢ (Base‘𝐶) ∈ V
24	23, 23	pm3.2i 474	. . . . . . 7 ⊢ ((Base‘𝐶) ∈ V ∧ (Base‘𝐶) ∈ V)
25		mpoexga 7826	. . . . . . 7 ⊢ (((Base‘𝐶) ∈ V ∧ (Base‘𝐶) ∈ V) → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) ∈ V)
26	24, 25	mp1i 13	. . . . . 6 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) ∈ V)
27	14, 21, 22, 26	fvmptd3 6819	. . . . 5 ⊢ (𝐶 ∈ Cat → (Inv‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))))
28	27	fneq1d 6450	. . . 4 ⊢ (𝐶 ∈ Cat → ((Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ↔ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) Fn ((Base‘𝐶) × (Base‘𝐶))))
29	13, 28	mpbird 260	. . 3 ⊢ (𝐶 ∈ Cat → (Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))
30		ssv 3911	. . . 4 ⊢ ran (Inv‘𝐶) ⊆ V
31	30	a1i 11	. . 3 ⊢ (𝐶 ∈ Cat → ran (Inv‘𝐶) ⊆ V)
32		fnco 6472	. . 3 ⊢ (((𝑥 ∈ V ↦ dom 𝑥) Fn V ∧ (Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ∧ ran (Inv‘𝐶) ⊆ V) → ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶)))
33	6, 29, 31, 32	syl3anc 1373	. 2 ⊢ (𝐶 ∈ Cat → ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶)))
34		isofval 17216	. . 3 ⊢ (𝐶 ∈ Cat → (Iso‘𝐶) = ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)))
35	34	fneq1d 6450	. 2 ⊢ (𝐶 ∈ Cat → ((Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ↔ ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶))))
36	33, 35	mpbird 260	1 ⊢ (𝐶 ∈ Cat → (Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))

Syntax hints:   → wi 4   ∧ wa 399   = wceq 1543   ∈ wcel 2112  ∀wral 3051  Vcvv 3398   ∩ cin 3852   ⊆ wss 3853   ↦ cmpt 5120   × cxp 5534  ^◡ccnv 5535  dom cdm 5536  ran crn 5537   ∘ ccom 5540   Fn wfn 6353  ‘cfv 6358  (class class class)co 7191   ∈ cmpo 7193  Basecbs 16666  Catccat 17121  Sectcsect 17203  Invcinv 17204  Isociso 17205

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-rep 5164  ax-sep 5177  ax-nul 5184  ax-pow 5243  ax-pr 5307  ax-un 7501

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-reu 3058  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-pw 4501  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-iun 4892  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-ov 7194  df-oprab 7195  df-mpo 7196  df-1st 7739  df-2nd 7740  df-inv 17207  df-iso 17208

This theorem is referenced by:  brcic  17257  ciclcl  17261  cicrcl  17262  cicer  17265