Theorem ringcsect 44309

Description: A section in the category of unital rings, written out. (Contributed by AV, 14-Feb-2020.)

Hypotheses

Ref	Expression
ringcsect.c	⊢ 𝐶 = (RingCat‘𝑈)
ringcsect.b	⊢ 𝐵 = (Base‘𝐶)
ringcsect.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
ringcsect.x	⊢ (𝜑 → 𝑋 ∈ 𝐵)
ringcsect.y	⊢ (𝜑 → 𝑌 ∈ 𝐵)
ringcsect.e	⊢ 𝐸 = (Base‘𝑋)
ringcsect.n	⊢ 𝑆 = (Sect‘𝐶)

Assertion

Ref	Expression
ringcsect	⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))

Proof of Theorem ringcsect

Step	Hyp	Ref	Expression
1		ringcsect.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
2		eqid 2823	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2823	. . 3 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		eqid 2823	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
5		ringcsect.n	. . 3 ⊢ 𝑆 = (Sect‘𝐶)
6		ringcsect.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
7		ringcsect.c	. . . . 5 ⊢ 𝐶 = (RingCat‘𝑈)
8	7	ringccat 44302	. . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
9	6, 8	syl 17	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
10		ringcsect.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
11		ringcsect.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
12	1, 2, 3, 4, 5, 9, 10, 11	issect 17025	. 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
13	7, 1, 6, 2, 10, 11	ringchom 44291	. . . . . . 7 ⊢ (𝜑 → (𝑋(Hom ‘𝐶)𝑌) = (𝑋 RingHom 𝑌))
14	13	eleq2d 2900	. . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹 ∈ (𝑋 RingHom 𝑌)))
15	7, 1, 6, 2, 11, 10	ringchom 44291	. . . . . . 7 ⊢ (𝜑 → (𝑌(Hom ‘𝐶)𝑋) = (𝑌 RingHom 𝑋))
16	15	eleq2d 2900	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ↔ 𝐺 ∈ (𝑌 RingHom 𝑋)))
17	14, 16	anbi12d 632	. . . . 5 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ↔ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))))
18	17	anbi1d 631	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
19	6	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝑈 ∈ 𝑉)
20	10	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝑋 ∈ 𝐵)
21	7, 1, 6	ringcbas 44289	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Ring))
22	21	eleq2d 2900	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ↔ 𝑋 ∈ (𝑈 ∩ Ring)))
23		inss1 4207	. . . . . . . . . . . 12 ⊢ (𝑈 ∩ Ring) ⊆ 𝑈
24	23	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑈 ∩ Ring) ⊆ 𝑈)
25	24	sseld 3968	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ (𝑈 ∩ Ring) → 𝑋 ∈ 𝑈))
26	22, 25	sylbid 242	. . . . . . . . 9 ⊢ (𝜑 → (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝑈))
27	26	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝑈))
28	20, 27	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝑋 ∈ 𝑈)
29	11	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝑌 ∈ 𝐵)
30	21	eleq2d 2900	. . . . . . . . . 10 ⊢ (𝜑 → (𝑌 ∈ 𝐵 ↔ 𝑌 ∈ (𝑈 ∩ Ring)))
31	24	sseld 3968	. . . . . . . . . 10 ⊢ (𝜑 → (𝑌 ∈ (𝑈 ∩ Ring) → 𝑌 ∈ 𝑈))
32	30, 31	sylbid 242	. . . . . . . . 9 ⊢ (𝜑 → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
33	32	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
34	29, 33	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝑌 ∈ 𝑈)
35		eqid 2823	. . . . . . . . . 10 ⊢ (Base‘𝑋) = (Base‘𝑋)
36		eqid 2823	. . . . . . . . . 10 ⊢ (Base‘𝑌) = (Base‘𝑌)
37	35, 36	rhmf 19480	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑋 RingHom 𝑌) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
38	37	adantr 483	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
39	38	adantl 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
40	36, 35	rhmf 19480	. . . . . . . . 9 ⊢ (𝐺 ∈ (𝑌 RingHom 𝑋) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
41	40	adantl 484	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
42	41	adantl 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
43	7, 19, 3, 28, 34, 28, 39, 42	ringcco 44295	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = (𝐺 ∘ 𝐹))
44		ringcsect.e	. . . . . . . 8 ⊢ 𝐸 = (Base‘𝑋)
45	7, 1, 4, 6, 10, 44	ringcid 44303	. . . . . . 7 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝐸))
46	45	adantr 483	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝐸))
47	43, 46	eqeq12d 2839	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ↔ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)))
48	47	pm5.32da 581	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
49	18, 48	bitrd 281	. . 3 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
50		df-3an 1085	. . 3 ⊢ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
51		df-3an 1085	. . 3 ⊢ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)) ↔ ((𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)))
52	49, 50, 51	3bitr4g 316	. 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
53	12, 52	bitrd 281	1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋 RingHom 𝑌) ∧ 𝐺 ∈ (𝑌 RingHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114   ∩ cin 3937   ⊆ wss 3938  ⟨cop 4575   class class class wbr 5068   I cid 5461   ↾ cres 5559   ∘ ccom 5561  ⟶wf 6353  ‘cfv 6357  (class class class)co 7158  Basecbs 16485  Hom chom 16578  compcco 16579  Catccat 16937  Idccid 16938  Sectcsect 17016  Ringcrg 19299   RingHom crh 19466  RingCatcringc 44281

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463  ax-cnex 10595  ax-resscn 10596  ax-1cn 10597  ax-icn 10598  ax-addcl 10599  ax-addrcl 10600  ax-mulcl 10601  ax-mulrcl 10602  ax-mulcom 10603  ax-addass 10604  ax-mulass 10605  ax-distr 10606  ax-i2m1 10607  ax-1ne0 10608  ax-1rid 10609  ax-rnegex 10610  ax-rrecex 10611  ax-cnre 10612  ax-pre-lttri 10613  ax-pre-lttrn 10614  ax-pre-ltadd 10615  ax-pre-mulgt0 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-nel 3126  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-riota 7116  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-er 8291  df-map 8410  df-pm 8411  df-ixp 8464  df-en 8512  df-dom 8513  df-sdom 8514  df-fin 8515  df-pnf 10679  df-mnf 10680  df-xr 10681  df-ltxr 10682  df-le 10683  df-sub 10874  df-neg 10875  df-nn 11641  df-2 11703  df-3 11704  df-4 11705  df-5 11706  df-6 11707  df-7 11708  df-8 11709  df-9 11710  df-n0 11901  df-z 11985  df-dec 12102  df-uz 12247  df-fz 12896  df-struct 16487  df-ndx 16488  df-slot 16489  df-base 16491  df-sets 16492  df-ress 16493  df-plusg 16580  df-hom 16591  df-cco 16592  df-0g 16717  df-cat 16941  df-cid 16942  df-homf 16943  df-sect 17019  df-ssc 17082  df-resc 17083  df-subc 17084  df-estrc 17375  df-mgm 17854  df-sgrp 17903  df-mnd 17914  df-mhm 17958  df-grp 18108  df-ghm 18358  df-mgp 19242  df-ur 19254  df-ring 19301  df-rnghom 19469  df-ringc 44283

This theorem is referenced by:  ringcinv  44310