Theorem isofn 17870

Description: The function value of the function returning the isomorphisms of a category is a function over the Cartesian square 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 7902	. . . . . 6 ⊢ (𝑥 ∈ V → dom 𝑥 ∈ V)
2	1	adantl 487	. . . . 5 ⊢ ((𝐶 ∈ Cat ∧ 𝑥 ∈ V) → dom 𝑥 ∈ V)
3	2	ralrimiva 3156	. . . 4 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ V dom 𝑥 ∈ V)
4		eqid 2762	. . . . 5 ⊢ (𝑥 ∈ V ↦ dom 𝑥) = (𝑥 ∈ V ↦ dom 𝑥)
5	4	fnmpt 6676	. . . 4 ⊢ (∀𝑥 ∈ V dom 𝑥 ∈ V → (𝑥 ∈ V ↦ dom 𝑥) Fn V)
6	3, 5	syl 18	. . 3 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ V ↦ dom 𝑥) Fn V)
7		ovex 7450	. . . . . . . 8 ⊢ (𝑥(Sect‘𝐶)𝑦) ∈ V
8	7	inex1 5284	. . . . . . 7 ⊢ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V
9	8	a1i 11	. . . . . 6 ⊢ ((𝐶 ∈ Cat ∧ (𝑥 ∈ (Base‘𝐶) ∧ 𝑦 ∈ (Base‘𝐶))) → ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V)
10	9	ralrimivva 3207	. . . . 5 ⊢ (𝐶 ∈ Cat → ∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V)
11		eqid 2762	. . . . . 6 ⊢ (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)))
12	11	fnmpo 8070	. . . . 5 ⊢ (∀𝑥 ∈ (Base‘𝐶)∀𝑦 ∈ (Base‘𝐶)((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)) ∈ V → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) Fn ((Base‘𝐶) × (Base‘𝐶)))
13	10, 12	syl 18	. . . 4 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) Fn ((Base‘𝐶) × (Base‘𝐶)))
14		df-inv 17843	. . . . . 6 ⊢ Inv = (𝑐 ∈ Cat ↦ (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))))
15		fveq2 6882	. . . . . . 7 ⊢ (𝑐 = 𝐶 → (Base‘𝑐) = (Base‘𝐶))
16		fveq2 6882	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (Sect‘𝑐) = (Sect‘𝐶))
17	16	oveqd 7434	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → (𝑥(Sect‘𝑐)𝑦) = (𝑥(Sect‘𝐶)𝑦))
18	16	oveqd 7434	. . . . . . . . 9 ⊢ (𝑐 = 𝐶 → (𝑦(Sect‘𝑐)𝑥) = (𝑦(Sect‘𝐶)𝑥))
19	18	cnveqd 5859	. . . . . . . 8 ⊢ (𝑐 = 𝐶 → ◡(𝑦(Sect‘𝑐)𝑥) = ◡(𝑦(Sect‘𝐶)𝑥))
20	17, 19	ineq12d 4170	. . . . . . 7 ⊢ (𝑐 = 𝐶 → ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥)) = ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥)))
21	15, 15, 20	mpoeq123dv 7492	. . . . . 6 ⊢ (𝑐 = 𝐶 → (𝑥 ∈ (Base‘𝑐), 𝑦 ∈ (Base‘𝑐) ↦ ((𝑥(Sect‘𝑐)𝑦) ∩ ◡(𝑦(Sect‘𝑐)𝑥))) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))))
22		id 23	. . . . . 6 ⊢ (𝐶 ∈ Cat → 𝐶 ∈ Cat)
23		fvex 6895	. . . . . . . 8 ⊢ (Base‘𝐶) ∈ V
24	23, 23	pm3.2i 476	. . . . . . 7 ⊢ ((Base‘𝐶) ∈ V ∧ (Base‘𝐶) ∈ V)
25		mpoexga 8080	. . . . . . 7 ⊢ (((Base‘𝐶) ∈ V ∧ (Base‘𝐶) ∈ V) → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) ∈ V)
26	24, 25	mp1i 14	. . . . . 6 ⊢ (𝐶 ∈ Cat → (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))) ∈ V)
27	14, 21, 22, 26	fvmptd3 7014	. . . . 5 ⊢ (𝐶 ∈ Cat → (Inv‘𝐶) = (𝑥 ∈ (Base‘𝐶), 𝑦 ∈ (Base‘𝐶) ↦ ((𝑥(Sect‘𝐶)𝑦) ∩ ◡(𝑦(Sect‘𝐶)𝑥))))
28	27	fneq1d 6629	. . . 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 3958	. . . 4 ⊢ ran (Inv‘𝐶) ⊆ V
31	30	a1i 11	. . 3 ⊢ (𝐶 ∈ Cat → ran (Inv‘𝐶) ⊆ V)
32		fnco 6654	. . 3 ⊢ (((𝑥 ∈ V ↦ dom 𝑥) Fn V ∧ (Inv‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ∧ ran (Inv‘𝐶) ⊆ V) → ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶)))
33	6, 29, 31, 32	syl3anc 1398	. 2 ⊢ (𝐶 ∈ Cat → ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶)))
34		isofval 17852	. . 3 ⊢ (𝐶 ∈ Cat → (Iso‘𝐶) = ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)))
35	34	fneq1d 6629	. 2 ⊢ (𝐶 ∈ Cat → ((Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)) ↔ ((𝑥 ∈ V ↦ dom 𝑥) ∘ (Inv‘𝐶)) Fn ((Base‘𝐶) × (Base‘𝐶))))
36	33, 35	mpbird 260	1 ⊢ (𝐶 ∈ Cat → (Iso‘𝐶) Fn ((Base‘𝐶) × (Base‘𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3078  Vcvv 3453   ∩ cin 3901   ⊆ wss 3902   ↦ cmpt 5190   × cxp 5657  ^◡ccnv 5658  dom cdm 5659  ran crn 5660   ∘ ccom 5663   Fn wfn 6532  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  Basecbs 17307  Catccat 17758  Sectcsect 17839  Invcinv 17840  Isociso 17841

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740

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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  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-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-inv 17843  df-iso 17844

This theorem is used by:  brcic  17893  ciclcl  17897  cicrcl  17898  cicer  17901  isofval2  49966  isopropdlem  49974  relcic  49979  upeu4  50130