Theorem rngcsect 20604

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

Hypotheses

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

Assertion

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

Proof of Theorem rngcsect

Step	Hyp	Ref	Expression
1		rngcsect.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
2		eqid 2737	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2737	. . 3 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		eqid 2737	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
5		rngcsect.n	. . 3 ⊢ 𝑆 = (Sect‘𝐶)
6		rngcsect.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
7		rngcsect.c	. . . . 5 ⊢ 𝐶 = (RngCat‘𝑈)
8	7	rngccat 20602	. . . 4 ⊢ (𝑈 ∈ 𝑉 → 𝐶 ∈ Cat)
9	6, 8	syl 17	. . 3 ⊢ (𝜑 → 𝐶 ∈ Cat)
10		rngcsect.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
11		rngcsect.y	. . 3 ⊢ (𝜑 → 𝑌 ∈ 𝐵)
12	1, 2, 3, 4, 5, 9, 10, 11	issect 17711	. 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
13	7, 1, 6, 2, 10, 11	rngchom 20591	. . . . . . 7 ⊢ (𝜑 → (𝑋(Hom ‘𝐶)𝑌) = (𝑋 RngHom 𝑌))
14	13	eleq2d 2823	. . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹 ∈ (𝑋 RngHom 𝑌)))
15	7, 1, 6, 2, 11, 10	rngchom 20591	. . . . . . 7 ⊢ (𝜑 → (𝑌(Hom ‘𝐶)𝑋) = (𝑌 RngHom 𝑋))
16	15	eleq2d 2823	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ↔ 𝐺 ∈ (𝑌 RngHom 𝑋)))
17	14, 16	anbi12d 633	. . . . 5 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ↔ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))))
18	17	anbi1d 632	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
19	6	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝑈 ∈ 𝑉)
20	10	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝑋 ∈ 𝐵)
21	7, 1, 6	rngcbas 20589	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Rng))
22	21	eleq2d 2823	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ↔ 𝑋 ∈ (𝑈 ∩ Rng)))
23		inss1 4178	. . . . . . . . . . . 12 ⊢ (𝑈 ∩ Rng) ⊆ 𝑈
24	23	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑈 ∩ Rng) ⊆ 𝑈)
25	24	sseld 3921	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ (𝑈 ∩ Rng) → 𝑋 ∈ 𝑈))
26	22, 25	sylbid 240	. . . . . . . . 9 ⊢ (𝜑 → (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝑈))
27	26	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝑈))
28	20, 27	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝑋 ∈ 𝑈)
29	11	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝑌 ∈ 𝐵)
30	21	eleq2d 2823	. . . . . . . . . 10 ⊢ (𝜑 → (𝑌 ∈ 𝐵 ↔ 𝑌 ∈ (𝑈 ∩ Rng)))
31	24	sseld 3921	. . . . . . . . . 10 ⊢ (𝜑 → (𝑌 ∈ (𝑈 ∩ Rng) → 𝑌 ∈ 𝑈))
32	30, 31	sylbid 240	. . . . . . . . 9 ⊢ (𝜑 → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
33	32	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
34	29, 33	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝑌 ∈ 𝑈)
35		eqid 2737	. . . . . . . . . 10 ⊢ (Base‘𝑋) = (Base‘𝑋)
36		eqid 2737	. . . . . . . . . 10 ⊢ (Base‘𝑌) = (Base‘𝑌)
37	35, 36	rnghmf 20419	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑋 RngHom 𝑌) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
38	37	adantr 480	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
39	38	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
40	36, 35	rnghmf 20419	. . . . . . . . 9 ⊢ (𝐺 ∈ (𝑌 RngHom 𝑋) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
41	40	adantl 481	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
42	41	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
43	7, 19, 3, 28, 34, 28, 39, 42	rngcco 20595	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = (𝐺 ∘ 𝐹))
44		rngcsect.e	. . . . . . . 8 ⊢ 𝐸 = (Base‘𝑋)
45	7, 1, 4, 6, 10, 44	rngcid 20603	. . . . . . 7 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝐸))
46	45	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝐸))
47	43, 46	eqeq12d 2753	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ↔ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)))
48	47	pm5.32da 579	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
49	18, 48	bitrd 279	. . 3 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
50		df-3an 1089	. . 3 ⊢ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
51		df-3an 1089	. . 3 ⊢ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)) ↔ ((𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)))
52	49, 50, 51	3bitr4g 314	. 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
53	12, 52	bitrd 279	1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋 RngHom 𝑌) ∧ 𝐺 ∈ (𝑌 RngHom 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ∩ cin 3889   ⊆ wss 3890  ⟨cop 4574   class class class wbr 5086   I cid 5518   ↾ cres 5626   ∘ ccom 5628  ⟶wf 6488  ‘cfv 6492  (class class class)co 7360  Basecbs 17170  Hom chom 17222  compcco 17223  Catccat 17621  Idccid 17622  Sectcsect 17702  Rngcrng 20124   RngHom crnghm 20405  RngCatcrngc 20584

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-er 8636  df-map 8768  df-pm 8769  df-ixp 8839  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-9 12242  df-n0 12429  df-z 12516  df-dec 12636  df-uz 12780  df-fz 13453  df-struct 17108  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-hom 17235  df-cco 17236  df-0g 17395  df-cat 17625  df-cid 17626  df-homf 17627  df-sect 17705  df-ssc 17768  df-resc 17769  df-subc 17770  df-estrc 18080  df-mgm 18599  df-mgmhm 18651  df-sgrp 18678  df-mnd 18694  df-mhm 18742  df-grp 18903  df-ghm 19179  df-abl 19749  df-mgp 20113  df-rng 20125  df-rnghm 20407  df-rngc 20585

This theorem is referenced by:  rngcinv  20605