Theorem rngcsect 44244

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	⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))

Proof of Theorem rngcsect

Step	Hyp	Ref	Expression
1		rngcsect.b	. . 3 ⊢ 𝐵 = (Base‘𝐶)
2		eqid 2821	. . 3 ⊢ (Hom ‘𝐶) = (Hom ‘𝐶)
3		eqid 2821	. . 3 ⊢ (comp‘𝐶) = (comp‘𝐶)
4		eqid 2821	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
5		rngcsect.n	. . 3 ⊢ 𝑆 = (Sect‘𝐶)
6		rngcsect.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
7		rngcsect.c	. . . . 5 ⊢ 𝐶 = (RngCat‘𝑈)
8	7	rngccat 44242	. . . 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 17017	. 2 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
13	7, 1, 6, 2, 10, 11	rngchom 44231	. . . . . . 7 ⊢ (𝜑 → (𝑋(Hom ‘𝐶)𝑌) = (𝑋 RngHomo 𝑌))
14	13	eleq2d 2898	. . . . . 6 ⊢ (𝜑 → (𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ↔ 𝐹 ∈ (𝑋 RngHomo 𝑌)))
15	7, 1, 6, 2, 11, 10	rngchom 44231	. . . . . . 7 ⊢ (𝜑 → (𝑌(Hom ‘𝐶)𝑋) = (𝑌 RngHomo 𝑋))
16	15	eleq2d 2898	. . . . . 6 ⊢ (𝜑 → (𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ↔ 𝐺 ∈ (𝑌 RngHomo 𝑋)))
17	14, 16	anbi12d 632	. . . . 5 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ↔ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))))
18	17	anbi1d 631	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋))))
19	6	adantr 483	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝑈 ∈ 𝑉)
20	10	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝑋 ∈ 𝐵)
21	7, 1, 6	rngcbas 44229	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Rng))
22	21	eleq2d 2898	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ 𝐵 ↔ 𝑋 ∈ (𝑈 ∩ Rng)))
23		inss1 4205	. . . . . . . . . . . 12 ⊢ (𝑈 ∩ Rng) ⊆ 𝑈
24	23	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑈 ∩ Rng) ⊆ 𝑈)
25	24	sseld 3966	. . . . . . . . . 10 ⊢ (𝜑 → (𝑋 ∈ (𝑈 ∩ Rng) → 𝑋 ∈ 𝑈))
26	22, 25	sylbid 242	. . . . . . . . 9 ⊢ (𝜑 → (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝑈))
27	26	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → (𝑋 ∈ 𝐵 → 𝑋 ∈ 𝑈))
28	20, 27	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝑋 ∈ 𝑈)
29	11	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝑌 ∈ 𝐵)
30	21	eleq2d 2898	. . . . . . . . . 10 ⊢ (𝜑 → (𝑌 ∈ 𝐵 ↔ 𝑌 ∈ (𝑈 ∩ Rng)))
31	24	sseld 3966	. . . . . . . . . 10 ⊢ (𝜑 → (𝑌 ∈ (𝑈 ∩ Rng) → 𝑌 ∈ 𝑈))
32	30, 31	sylbid 242	. . . . . . . . 9 ⊢ (𝜑 → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
33	32	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → (𝑌 ∈ 𝐵 → 𝑌 ∈ 𝑈))
34	29, 33	mpd 15	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝑌 ∈ 𝑈)
35		eqid 2821	. . . . . . . . . 10 ⊢ (Base‘𝑋) = (Base‘𝑋)
36		eqid 2821	. . . . . . . . . 10 ⊢ (Base‘𝑌) = (Base‘𝑌)
37	35, 36	rnghmf 44163	. . . . . . . . 9 ⊢ (𝐹 ∈ (𝑋 RngHomo 𝑌) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
38	37	adantr 483	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
39	38	adantl 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝐹:(Base‘𝑋)⟶(Base‘𝑌))
40	36, 35	rnghmf 44163	. . . . . . . . 9 ⊢ (𝐺 ∈ (𝑌 RngHomo 𝑋) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
41	40	adantl 484	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
42	41	adantl 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → 𝐺:(Base‘𝑌)⟶(Base‘𝑋))
43	7, 19, 3, 28, 34, 28, 39, 42	rngcco 44235	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = (𝐺 ∘ 𝐹))
44		rngcsect.e	. . . . . . . 8 ⊢ 𝐸 = (Base‘𝑋)
45	7, 1, 4, 6, 10, 44	rngcid 44243	. . . . . . 7 ⊢ (𝜑 → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝐸))
46	45	adantr 483	. . . . . 6 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → ((Id‘𝐶)‘𝑋) = ( I ↾ 𝐸))
47	43, 46	eqeq12d 2837	. . . . 5 ⊢ ((𝜑 ∧ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋))) → ((𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋) ↔ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)))
48	47	pm5.32da 581	. . . 4 ⊢ (𝜑 → (((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
49	18, 48	bitrd 281	. . 3 ⊢ (𝜑 → (((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
50		df-3an 1085	. . 3 ⊢ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋)) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)))
51		df-3an 1085	. . 3 ⊢ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)) ↔ ((𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋)) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸)))
52	49, 50, 51	3bitr4g 316	. 2 ⊢ (𝜑 → ((𝐹 ∈ (𝑋(Hom ‘𝐶)𝑌) ∧ 𝐺 ∈ (𝑌(Hom ‘𝐶)𝑋) ∧ (𝐺(⟨𝑋, 𝑌⟩(comp‘𝐶)𝑋)𝐹) = ((Id‘𝐶)‘𝑋)) ↔ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))
53	12, 52	bitrd 281	1 ⊢ (𝜑 → (𝐹(𝑋𝑆𝑌)𝐺 ↔ (𝐹 ∈ (𝑋 RngHomo 𝑌) ∧ 𝐺 ∈ (𝑌 RngHomo 𝑋) ∧ (𝐺 ∘ 𝐹) = ( I ↾ 𝐸))))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110   ∩ cin 3935   ⊆ wss 3936  ⟨cop 4567   class class class wbr 5059   I cid 5454   ↾ cres 5552   ∘ ccom 5554  ⟶wf 6346  ‘cfv 6350  (class class class)co 7150  Basecbs 16477  Hom chom 16570  compcco 16571  Catccat 16929  Idccid 16930  Sectcsect 17008  Rngcrng 44138   RngHomo crngh 44149  RngCatcrngc 44221

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2156  ax-12 2172  ax-ext 2793  ax-rep 5183  ax-sep 5196  ax-nul 5203  ax-pow 5259  ax-pr 5322  ax-un 7455  ax-cnex 10587  ax-resscn 10588  ax-1cn 10589  ax-icn 10590  ax-addcl 10591  ax-addrcl 10592  ax-mulcl 10593  ax-mulrcl 10594  ax-mulcom 10595  ax-addass 10596  ax-mulass 10597  ax-distr 10598  ax-i2m1 10599  ax-1ne0 10600  ax-1rid 10601  ax-rnegex 10602  ax-rrecex 10603  ax-cnre 10604  ax-pre-lttri 10605  ax-pre-lttrn 10606  ax-pre-ltadd 10607  ax-pre-mulgt0 10608

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-fal 1546  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3497  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4562  df-pr 4564  df-tp 4566  df-op 4568  df-uni 4833  df-int 4870  df-iun 4914  df-br 5060  df-opab 5122  df-mpt 5140  df-tr 5166  df-id 5455  df-eprel 5460  df-po 5469  df-so 5470  df-fr 5509  df-we 5511  df-xp 5556  df-rel 5557  df-cnv 5558  df-co 5559  df-dm 5560  df-rn 5561  df-res 5562  df-ima 5563  df-pred 6143  df-ord 6189  df-on 6190  df-lim 6191  df-suc 6192  df-iota 6309  df-fun 6352  df-fn 6353  df-f 6354  df-f1 6355  df-fo 6356  df-f1o 6357  df-fv 6358  df-riota 7108  df-ov 7153  df-oprab 7154  df-mpo 7155  df-om 7575  df-1st 7683  df-2nd 7684  df-wrecs 7941  df-recs 8002  df-rdg 8040  df-1o 8096  df-oadd 8100  df-er 8283  df-map 8402  df-pm 8403  df-ixp 8456  df-en 8504  df-dom 8505  df-sdom 8506  df-fin 8507  df-pnf 10671  df-mnf 10672  df-xr 10673  df-ltxr 10674  df-le 10675  df-sub 10866  df-neg 10867  df-nn 11633  df-2 11694  df-3 11695  df-4 11696  df-5 11697  df-6 11698  df-7 11699  df-8 11700  df-9 11701  df-n0 11892  df-z 11976  df-dec 12093  df-uz 12238  df-fz 12887  df-struct 16479  df-ndx 16480  df-slot 16481  df-base 16483  df-sets 16484  df-ress 16485  df-plusg 16572  df-hom 16583  df-cco 16584  df-0g 16709  df-cat 16933  df-cid 16934  df-homf 16935  df-sect 17011  df-ssc 17074  df-resc 17075  df-subc 17076  df-estrc 17367  df-mgm 17846  df-sgrp 17895  df-mnd 17906  df-mhm 17950  df-grp 18100  df-ghm 18350  df-abl 18903  df-mgp 19234  df-mgmhm 44039  df-rng0 44139  df-rnghomo 44151  df-rngc 44223

This theorem is referenced by:  rngcinv  44245