Theorem isofn 17658

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 7840	. . . . . 6 ⊢ (𝑥 ∈ V → dom 𝑥 ∈ V)
2	1	adantl 482	. . . . 5 ⊢ ((𝐶 ∈ Cat ∧ 𝑥 ∈ V) → dom 𝑥 ∈ V)
3	2	ralrimiva 3143	. . . 4 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ V dom 𝑥 ∈ V)
4		eqid 2736	. . . . 5 ⊢ (𝑥 ∈ V ↦ dom 𝑥) = (𝑥 ∈ V ↦ dom 𝑥)
5	4	fnmpt 6641	. . . 4 ⊢ (∀𝑥 ∈ V dom 𝑥 ∈ V → (𝑥 ∈ V ↦ dom 𝑥) Fn V)
6	3, 5	syl 17	. . 3 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ V ↦ dom 𝑥) Fn V)
7		ovex 7390	. . . . . . . 8 ⊢ (𝑥(Sect‘𝐶)𝑦) ∈ V
8	7	inex1 5274	. . . . . . 7 ⊢ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V
9	8	a1i 11	. . . . . 6 ⊢ ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V)
10	9	ralrimivva 3197	. . . . 5 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V)
11		eqid 2736	. . . . . 6 ⊢ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)))
12	11	fnmpo 8001	. . . . 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 17631	. . . . . 6 ⊢ Inv = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))))
15		fveq2 6842	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
16		fveq2 6842	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (Sect‘𝑐) = (Sect‘𝐶))
17	16	oveqd 7374	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → (𝑥(Sect‘𝑐)𝑦) = (𝑥(Sect‘𝐶)𝑦))
18	16	oveqd 7374	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (𝑦(Sect‘𝑐)𝑥) = (𝑦(Sect‘𝐶)𝑥))
19	18	cnveqd 5831	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → ◡(𝑦(Sect‘𝑐)𝑥) = ◡(𝑦(Sect‘𝐶)𝑥))
20	17, 19	ineq12d 4173	. . . . . . 7 ⊢ (𝑐 = 𝐶 → ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥)) = ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)))
21	15, 15, 20	mpoeq123dv 7432	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))))
22		id 22	. . . . . 6 ⊢ (𝐶 ∈ Cat → 𝐶 ∈ Cat)
23		fvex 6855	. . . . . . . 8 ⊢ (Base‘𝐶) ∈ V
24	23, 23	pm3.2i 471	. . . . . . 7 ⊢ ((Base‘𝐶) ∈ V ∧ (Base‘𝐶) ∈ V)
25		mpoexga 8010	. . . . . . 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 6971	. . . . 5 ⊢ (𝐶 ∈ Cat → (Inv‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))))
28	27	fneq1d 6595	. . . 4 ⊢ (𝐶 ∈ Cat → ((Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ↔ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) Fn ((Base‘𝐶) × (Base‘𝐶))))
29	13, 28	mpbird 256	. . 3 ⊢ (𝐶 ∈ Cat → (Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))
30		ssv 3968	. . . 4 ⊢ ran (Inv‘𝐶) ⊆ V
31	30	a1i 11	. . 3 ⊢ (𝐶 ∈ Cat → ran (Inv‘𝐶) ⊆ V)
32		fnco 6618	. . 3 ⊢ (((𝑥 ∈ V ↦ dom 𝑥) Fn V ∧ (Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ∧ ran (Inv‘𝐶) ⊆ V) → ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶)))
33	6, 29, 31, 32	syl3anc 1371	. 2 ⊢ (𝐶 ∈ Cat → ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶)))
34		isofval 17640	. . 3 ⊢ (𝐶 ∈ Cat → (Iso‘𝐶) = ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)))
35	34	fneq1d 6595	. 2 ⊢ (𝐶 ∈ Cat → ((Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ↔ ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶))))
36	33, 35	mpbird 256	1 ⊢ (𝐶 ∈ Cat → (Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ∩ cin 3909   ⊆ wss 3910   ↦ cmpt 5188   × cxp 5631  ^◡ccnv 5632  dom cdm 5633  ran crn 5634   ∘ ccom 5637   Fn wfn 6491  ‘cfv 6496  (class class class)co 7357   ∈ cmpo 7359  Basecbs 17083  Catccat 17544  Sectcsect 17627  Invcinv 17628  Isociso 17629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-1st 7921  df-2nd 7922  df-inv 17631  df-iso 17632

This theorem is referenced by:  brcic  17681  ciclcl  17685  cicrcl  17686  cicer  17689