Theorem rngqiprngimf1 21189

Description: 𝐹 is a one-to-one function from (the base set of) a non-unital ring to the product of the (base set of the) quotient with a two-sided ideal and the (base set of the) two-sided ideal. (Contributed by AV, 7-Mar-2025.)

Hypotheses

Ref	Expression
rng2idlring.r	⊢ (𝜑 → 𝑅 ∈ Rng)
rng2idlring.i	⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
rng2idlring.j	⊢ 𝐽 = (𝑅 ↾s 𝐼)
rng2idlring.u	⊢ (𝜑 → 𝐽 ∈ Ring)
rng2idlring.b	⊢ 𝐵 = (Base‘𝑅)
rng2idlring.t	⊢ · = (.r‘𝑅)
rng2idlring.1	⊢ 1 = (1r‘𝐽)
rngqiprngim.g	⊢ ∼ = (𝑅 ~QG 𝐼)
rngqiprngim.q	⊢ 𝑄 = (𝑅 /s ∼ )
rngqiprngim.c	⊢ 𝐶 = (Base‘𝑄)
rngqiprngim.p	⊢ 𝑃 = (𝑄 ×s 𝐽)
rngqiprngim.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)

Assertion

Ref	Expression
rngqiprngimf1	⊢ (𝜑 → 𝐹:𝐵–1-1→(𝐶 × 𝐼))

Distinct variable groups:   𝑥,𝐶   𝑥,𝐼   𝑥,𝐵   𝜑,𝑥   𝑥, ∼   𝑥, 1   𝑥, ·   𝑥,𝑅

Allowed substitution hints:   𝑃(𝑥)   𝑄(𝑥)   𝐹(𝑥)   𝐽(𝑥)

Proof of Theorem rngqiprngimf1

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		rng2idlring.r	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ Rng)
2		rng2idlring.i	. . . . . . . . 9 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
3		rng2idlring.j	. . . . . . . . . . . 12 ⊢ 𝐽 = (𝑅 ↾s 𝐼)
4		rng2idlring.u	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐽 ∈ Ring)
5		ringrng 20220	. . . . . . . . . . . . 13 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
6	4, 5	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐽 ∈ Rng)
7	3, 6	eqeltrrid 2834	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑅 ↾s 𝐼) ∈ Rng)
8	1, 2, 7	rng2idlnsg 21159	. . . . . . . . . 10 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
9		nsgsubg 19112	. . . . . . . . . 10 ⊢ (𝐼 ∈ (NrmSGrp‘𝑅) → 𝐼 ∈ (SubGrp‘𝑅))
10	8, 9	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐼 ∈ (SubGrp‘𝑅))
11		rngqiprngim.q	. . . . . . . . . . 11 ⊢ 𝑄 = (𝑅 /s ∼ )
12		rngqiprngim.g	. . . . . . . . . . . 12 ⊢ ∼ = (𝑅 ~QG 𝐼)
13	12	oveq2i 7431	. . . . . . . . . . 11 ⊢ (𝑅 /s ∼ ) = (𝑅 /s (𝑅 ~QG 𝐼))
14	11, 13	eqtri 2756	. . . . . . . . . 10 ⊢ 𝑄 = (𝑅 /s (𝑅 ~QG 𝐼))
15		eqid 2728	. . . . . . . . . 10 ⊢ (2Ideal‘𝑅) = (2Ideal‘𝑅)
16	14, 15	qus2idrng 21166	. . . . . . . . 9 ⊢ ((𝑅 ∈ Rng ∧ 𝐼 ∈ (2Ideal‘𝑅) ∧ 𝐼 ∈ (SubGrp‘𝑅)) → 𝑄 ∈ Rng)
17	1, 2, 10, 16	syl3anc 1369	. . . . . . . 8 ⊢ (𝜑 → 𝑄 ∈ Rng)
18		rnggrp 20097	. . . . . . . . 9 ⊢ (𝑄 ∈ Rng → 𝑄 ∈ Grp)
19	18	grpmndd 18902	. . . . . . . 8 ⊢ (𝑄 ∈ Rng → 𝑄 ∈ Mnd)
20	17, 19	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑄 ∈ Mnd)
21		ringmnd 20182	. . . . . . . 8 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Mnd)
22	4, 21	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐽 ∈ Mnd)
23		rngqiprngim.p	. . . . . . . 8 ⊢ 𝑃 = (𝑄 ×s 𝐽)
24	23	xpsmnd0 18734	. . . . . . 7 ⊢ ((𝑄 ∈ Mnd ∧ 𝐽 ∈ Mnd) → (0g‘𝑃) = ⟨(0g‘𝑄), (0g‘𝐽)⟩)
25	20, 22, 24	syl2anc 583	. . . . . 6 ⊢ (𝜑 → (0g‘𝑃) = ⟨(0g‘𝑄), (0g‘𝐽)⟩)
26	25	sneqd 4641	. . . . 5 ⊢ (𝜑 → {(0g‘𝑃)} = {⟨(0g‘𝑄), (0g‘𝐽)⟩})
27	26	imaeq2d 6063	. . . 4 ⊢ (𝜑 → (◡𝐹 “ {(0g‘𝑃)}) = (◡𝐹 “ {⟨(0g‘𝑄), (0g‘𝐽)⟩}))
28		nfv 1910	. . . . . 6 ⊢ Ⅎ𝑥𝜑
29		opex 5466	. . . . . . 7 ⊢ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩ ∈ V
30	29	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩ ∈ V)
31		rngqiprngim.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)
32	28, 30, 31	fnmptd 6696	. . . . 5 ⊢ (𝜑 → 𝐹 Fn 𝐵)
33		fncnvima2 7070	. . . . 5 ⊢ (𝐹 Fn 𝐵 → (◡𝐹 “ {⟨(0g‘𝑄), (0g‘𝐽)⟩}) = {𝑎 ∈ 𝐵 ∣ (𝐹‘𝑎) ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}})
34	32, 33	syl 17	. . . 4 ⊢ (𝜑 → (◡𝐹 “ {⟨(0g‘𝑄), (0g‘𝐽)⟩}) = {𝑎 ∈ 𝐵 ∣ (𝐹‘𝑎) ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}})
35		rng2idlring.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
36		rng2idlring.t	. . . . . . . 8 ⊢ · = (.r‘𝑅)
37		rng2idlring.1	. . . . . . . 8 ⊢ 1 = (1r‘𝐽)
38		rngqiprngim.c	. . . . . . . 8 ⊢ 𝐶 = (Base‘𝑄)
39	1, 2, 3, 4, 35, 36, 37, 12, 11, 38, 23, 31	rngqiprngimfv 21187	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
40	39	eleq1d 2814	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → ((𝐹‘𝑎) ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩} ↔ ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}))
41	40	rabbidva 3436	. . . . 5 ⊢ (𝜑 → {𝑎 ∈ 𝐵 ∣ (𝐹‘𝑎) ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}} = {𝑎 ∈ 𝐵 ∣ ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}})
42		eceq1 8762	. . . . . . . 8 ⊢ (𝑎 = (0g‘𝑅) → [𝑎] ∼ = [(0g‘𝑅)] ∼ )
43		oveq2 7428	. . . . . . . 8 ⊢ (𝑎 = (0g‘𝑅) → ( 1 · 𝑎) = ( 1 · (0g‘𝑅)))
44	42, 43	opeq12d 4882	. . . . . . 7 ⊢ (𝑎 = (0g‘𝑅) → ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ = ⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩)
45	44	eleq1d 2814	. . . . . 6 ⊢ (𝑎 = (0g‘𝑅) → (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩} ↔ ⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}))
46		rnggrp 20097	. . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
47	1, 46	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑅 ∈ Grp)
48	47	grpmndd 18902	. . . . . . 7 ⊢ (𝜑 → 𝑅 ∈ Mnd)
49		eqid 2728	. . . . . . . 8 ⊢ (0g‘𝑅) = (0g‘𝑅)
50	35, 49	mndidcl 18708	. . . . . . 7 ⊢ (𝑅 ∈ Mnd → (0g‘𝑅) ∈ 𝐵)
51	48, 50	syl 17	. . . . . 6 ⊢ (𝜑 → (0g‘𝑅) ∈ 𝐵)
52	12	eceq2i 8765	. . . . . . . . 9 ⊢ [(0g‘𝑅)] ∼ = [(0g‘𝑅)](𝑅 ~QG 𝐼)
53	14, 49	qus0 19143	. . . . . . . . . 10 ⊢ (𝐼 ∈ (NrmSGrp‘𝑅) → [(0g‘𝑅)](𝑅 ~QG 𝐼) = (0g‘𝑄))
54	8, 53	syl 17	. . . . . . . . 9 ⊢ (𝜑 → [(0g‘𝑅)](𝑅 ~QG 𝐼) = (0g‘𝑄))
55	52, 54	eqtrid 2780	. . . . . . . 8 ⊢ (𝜑 → [(0g‘𝑅)] ∼ = (0g‘𝑄))
56	1, 2, 7	rng2idl0 21160	. . . . . . . . . . 11 ⊢ (𝜑 → (0g‘𝑅) ∈ 𝐼)
57	35, 15	2idlss 21155	. . . . . . . . . . . 12 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → 𝐼 ⊆ 𝐵)
58	2, 57	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐼 ⊆ 𝐵)
59	3, 35, 49	ress0g 18721	. . . . . . . . . . 11 ⊢ ((𝑅 ∈ Mnd ∧ (0g‘𝑅) ∈ 𝐼 ∧ 𝐼 ⊆ 𝐵) → (0g‘𝑅) = (0g‘𝐽))
60	48, 56, 58, 59	syl3anc 1369	. . . . . . . . . 10 ⊢ (𝜑 → (0g‘𝑅) = (0g‘𝐽))
61	60	oveq2d 7436	. . . . . . . . 9 ⊢ (𝜑 → ( 1 · (0g‘𝑅)) = ( 1 · (0g‘𝐽)))
62	3, 36	ressmulr 17287	. . . . . . . . . . 11 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → · = (.r‘𝐽))
63	2, 62	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → · = (.r‘𝐽))
64	63	oveqd 7437	. . . . . . . . 9 ⊢ (𝜑 → ( 1 · (0g‘𝐽)) = ( 1 (.r‘𝐽)(0g‘𝐽)))
65		eqid 2728	. . . . . . . . . . 11 ⊢ (Base‘𝐽) = (Base‘𝐽)
66	65, 37	ringidcl 20201	. . . . . . . . . 10 ⊢ (𝐽 ∈ Ring → 1 ∈ (Base‘𝐽))
67		eqid 2728	. . . . . . . . . . 11 ⊢ (.r‘𝐽) = (.r‘𝐽)
68		eqid 2728	. . . . . . . . . . 11 ⊢ (0g‘𝐽) = (0g‘𝐽)
69	65, 67, 68	ringrz 20229	. . . . . . . . . 10 ⊢ ((𝐽 ∈ Ring ∧ 1 ∈ (Base‘𝐽)) → ( 1 (.r‘𝐽)(0g‘𝐽)) = (0g‘𝐽))
70	4, 66, 69	syl2anc2 584	. . . . . . . . 9 ⊢ (𝜑 → ( 1 (.r‘𝐽)(0g‘𝐽)) = (0g‘𝐽))
71	61, 64, 70	3eqtrd 2772	. . . . . . . 8 ⊢ (𝜑 → ( 1 · (0g‘𝑅)) = (0g‘𝐽))
72	55, 71	opeq12d 4882	. . . . . . 7 ⊢ (𝜑 → ⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩ = ⟨(0g‘𝑄), (0g‘𝐽)⟩)
73		opex 5466	. . . . . . . 8 ⊢ ⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩ ∈ V
74	73	elsn 4644	. . . . . . 7 ⊢ (⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩} ↔ ⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩ = ⟨(0g‘𝑄), (0g‘𝐽)⟩)
75	72, 74	sylibr 233	. . . . . 6 ⊢ (𝜑 → ⟨[(0g‘𝑅)] ∼ , ( 1 · (0g‘𝑅))⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩})
76		opex 5466	. . . . . . . . . 10 ⊢ ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ V
77	76	elsn 4644	. . . . . . . . 9 ⊢ (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩} ↔ ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ = ⟨(0g‘𝑄), (0g‘𝐽)⟩)
78	12	ovexi 7454	. . . . . . . . . . 11 ⊢ ∼ ∈ V
79		ecexg 8728	. . . . . . . . . . 11 ⊢ ( ∼ ∈ V → [𝑎] ∼ ∈ V)
80	78, 79	ax-mp 5	. . . . . . . . . 10 ⊢ [𝑎] ∼ ∈ V
81		ovex 7453	. . . . . . . . . 10 ⊢ ( 1 · 𝑎) ∈ V
82	80, 81	opth 5478	. . . . . . . . 9 ⊢ (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ = ⟨(0g‘𝑄), (0g‘𝐽)⟩ ↔ ([𝑎] ∼ = (0g‘𝑄) ∧ ( 1 · 𝑎) = (0g‘𝐽)))
83	77, 82	bitri 275	. . . . . . . 8 ⊢ (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩} ↔ ([𝑎] ∼ = (0g‘𝑄) ∧ ( 1 · 𝑎) = (0g‘𝐽)))
84	1, 2, 3, 4, 35, 36, 37, 12, 11	rngqiprngimf1lem 21183	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (([𝑎] ∼ = (0g‘𝑄) ∧ ( 1 · 𝑎) = (0g‘𝐽)) → 𝑎 = (0g‘𝑅)))
85	83, 84	biimtrid 241	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩} → 𝑎 = (0g‘𝑅)))
86	85	imp 406	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝐵) ∧ ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}) → 𝑎 = (0g‘𝑅))
87	45, 51, 75, 86	rabeqsnd 4672	. . . . 5 ⊢ (𝜑 → {𝑎 ∈ 𝐵 ∣ ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}} = {(0g‘𝑅)})
88	41, 87	eqtrd 2768	. . . 4 ⊢ (𝜑 → {𝑎 ∈ 𝐵 ∣ (𝐹‘𝑎) ∈ {⟨(0g‘𝑄), (0g‘𝐽)⟩}} = {(0g‘𝑅)})
89	27, 34, 88	3eqtrd 2772	. . 3 ⊢ (𝜑 → (◡𝐹 “ {(0g‘𝑃)}) = {(0g‘𝑅)})
90	1, 2, 3, 4, 35, 36, 37, 12, 11, 38, 23, 31	rngqiprngghm 21188	. . . 4 ⊢ (𝜑 → 𝐹 ∈ (𝑅 GrpHom 𝑃))
91		eqid 2728	. . . . 5 ⊢ (Base‘𝑃) = (Base‘𝑃)
92		eqid 2728	. . . . 5 ⊢ (0g‘𝑃) = (0g‘𝑃)
93	35, 91, 49, 92	kerf1ghm 19200	. . . 4 ⊢ (𝐹 ∈ (𝑅 GrpHom 𝑃) → (𝐹:𝐵–1-1→(Base‘𝑃) ↔ (◡𝐹 “ {(0g‘𝑃)}) = {(0g‘𝑅)}))
94	90, 93	syl 17	. . 3 ⊢ (𝜑 → (𝐹:𝐵–1-1→(Base‘𝑃) ↔ (◡𝐹 “ {(0g‘𝑃)}) = {(0g‘𝑅)}))
95	89, 94	mpbird 257	. 2 ⊢ (𝜑 → 𝐹:𝐵–1-1→(Base‘𝑃))
96		eqidd 2729	. . 3 ⊢ (𝜑 → 𝐹 = 𝐹)
97		eqidd 2729	. . 3 ⊢ (𝜑 → 𝐵 = 𝐵)
98	1, 2, 3, 4, 35, 36, 37, 12, 11, 38, 23	rngqipbas 21184	. . 3 ⊢ (𝜑 → (Base‘𝑃) = (𝐶 × 𝐼))
99	96, 97, 98	f1eq123d 6831	. 2 ⊢ (𝜑 → (𝐹:𝐵–1-1→(Base‘𝑃) ↔ 𝐹:𝐵–1-1→(𝐶 × 𝐼)))
100	95, 99	mpbid 231	1 ⊢ (𝜑 → 𝐹:𝐵–1-1→(𝐶 × 𝐼))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   = wceq 1534   ∈ wcel 2099  {crab 3429  Vcvv 3471   ⊆ wss 3947  {csn 4629  ⟨cop 4635   ↦ cmpt 5231   × cxp 5676  ^◡ccnv 5677   “ cima 5681   Fn wfn 6543  –1-1→wf1 6545  ‘cfv 6548  (class class class)co 7420  [cec 8722  Basecbs 17179   ↾_s cress 17208  ._rcmulr 17233  0_gc0g 17420   /_s cqus 17486   ×_s cxps 17487  Mndcmnd 18693  Grpcgrp 18889  SubGrpcsubg 19074  NrmSGrpcnsg 19075   ~_QG cqg 19076   GrpHom cghm 19166  Rngcrng 20091  1_rcur 20120  Ringcrg 20172  2Idealc2idl 21142

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740  ax-cnex 11194  ax-resscn 11195  ax-1cn 11196  ax-icn 11197  ax-addcl 11198  ax-addrcl 11199  ax-mulcl 11200  ax-mulrcl 11201  ax-mulcom 11202  ax-addass 11203  ax-mulass 11204  ax-distr 11205  ax-i2m1 11206  ax-1ne0 11207  ax-1rid 11208  ax-rnegex 11209  ax-rrecex 11210  ax-cnre 11211  ax-pre-lttri 11212  ax-pre-lttrn 11213  ax-pre-ltadd 11214  ax-pre-mulgt0 11215

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-nel 3044  df-ral 3059  df-rex 3068  df-rmo 3373  df-reu 3374  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-tp 4634  df-op 4636  df-uni 4909  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6305  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-f1 6553  df-fo 6554  df-f1o 6555  df-fv 6556  df-riota 7376  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7871  df-1st 7993  df-2nd 7994  df-tpos 8231  df-frecs 8286  df-wrecs 8317  df-recs 8391  df-rdg 8430  df-1o 8486  df-2o 8487  df-er 8724  df-ec 8726  df-qs 8730  df-map 8846  df-ixp 8916  df-en 8964  df-dom 8965  df-sdom 8966  df-fin 8967  df-sup 9465  df-inf 9466  df-pnf 11280  df-mnf 11281  df-xr 11282  df-ltxr 11283  df-le 11284  df-sub 11476  df-neg 11477  df-nn 12243  df-2 12305  df-3 12306  df-4 12307  df-5 12308  df-6 12309  df-7 12310  df-8 12311  df-9 12312  df-n0 12503  df-z 12589  df-dec 12708  df-uz 12853  df-fz 13517  df-struct 17115  df-sets 17132  df-slot 17150  df-ndx 17162  df-base 17180  df-ress 17209  df-plusg 17245  df-mulr 17246  df-sca 17248  df-vsca 17249  df-ip 17250  df-tset 17251  df-ple 17252  df-ds 17254  df-hom 17256  df-cco 17257  df-0g 17422  df-prds 17428  df-imas 17489  df-qus 17490  df-xps 17491  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-grp 18892  df-minusg 18893  df-sbg 18894  df-subg 19077  df-nsg 19078  df-eqg 19079  df-ghm 19167  df-cmn 19736  df-abl 19737  df-mgp 20074  df-rng 20092  df-ur 20121  df-ring 20174  df-oppr 20272  df-dvdsr 20295  df-unit 20296  df-invr 20326  df-subrng 20482  df-lss 20815  df-sra 21057  df-rgmod 21058  df-lidl 21103  df-2idl 21143

This theorem is referenced by:  rngqiprngim  21193

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »