rngqiprngimfo - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > rngqiprngimfo		Structured version Visualization version GIF version

Theorem rngqiprngimfo 21190

Description: 𝐹 is a function from (the base set of) a non-unital ring onto 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, 5-Mar-2025.) (Proof shortened by AV, 24-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 = (1_r‘𝐽)
rngqiprngim.g	⊢ ∼ = (𝑅 ~_QG 𝐼)
rngqiprngim.q	⊢ 𝑄 = (𝑅 /_s ∼ )
rngqiprngim.c	⊢ 𝐶 = (Base‘𝑄)
rngqiprngim.p	⊢ 𝑃 = (𝑄 ×_s 𝐽)
rngqiprngim.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)

**Assertion**
Ref	Expression
rngqiprngimfo	⊢ (𝜑 → 𝐹:𝐵–onto→(𝐶 × 𝐼))

Distinct variable groups: 𝑥,𝐶 𝑥,𝐼 𝑥,𝐵 𝜑,𝑥 𝑥, ∼ 𝑥, 1 𝑥, · 𝑥,𝑅 Allowed substitution hints: 𝑃(𝑥) 𝑄(𝑥) 𝐹(𝑥) 𝐽(𝑥)

Proof of Theorem rngqiprngimfo Dummy variables 𝑎 𝑏 𝑐 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rng2idlring.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ Rng)
2		rng2idlring.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ (2Ideal‘𝑅))
3		rng2idlring.j	. . 3 ⊢ 𝐽 = (𝑅 ↾_s 𝐼)
4		rng2idlring.u	. . 3 ⊢ (𝜑 → 𝐽 ∈ Ring)
5		rng2idlring.b	. . 3 ⊢ 𝐵 = (Base‘𝑅)
6		rng2idlring.t	. . 3 ⊢ · = (._r‘𝑅)
7		rng2idlring.1	. . 3 ⊢ 1 = (1_r‘𝐽)
8		rngqiprngim.g	. . 3 ⊢ ∼ = (𝑅 ~_QG 𝐼)
9		rngqiprngim.q	. . 3 ⊢ 𝑄 = (𝑅 /_s ∼ )
10		rngqiprngim.c	. . 3 ⊢ 𝐶 = (Base‘𝑄)
11		rngqiprngim.p	. . 3 ⊢ 𝑃 = (𝑄 ×_s 𝐽)
12		rngqiprngim.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ ⟨[𝑥] ∼ , ( 1 · 𝑥)⟩)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	rngqiprngimf 21186	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶(𝐶 × 𝐼))
14		elxpi 5695	. . . . 5 ⊢ (𝑏 ∈ (𝐶 × 𝐼) → ∃𝑝∃𝑞(𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)))
15	10	eleq2i 2817	. . . . . . . . . . . . . 14 ⊢ (𝑝 ∈ 𝐶 ↔ 𝑝 ∈ (Base‘𝑄))
16		vex 3467	. . . . . . . . . . . . . . 15 ⊢ 𝑝 ∈ V
17	8, 9, 5	quselbas 19138	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ Rng ∧ 𝑝 ∈ V) → (𝑝 ∈ (Base‘𝑄) ↔ ∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ ))
18	1, 16, 17	sylancl 584	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑝 ∈ (Base‘𝑄) ↔ ∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ ))
19	15, 18	bitrid 282	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑝 ∈ 𝐶 ↔ ∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ ))
20		eqid 2725	. . . . . . . . . . . . . . . . . . 19 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
21		rnggrp 20097	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
22	1, 21	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑅 ∈ Grp)
23	22	ad2antrr 724	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑅 ∈ Grp)
24		simpr 483	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑐 ∈ 𝐵)
25	1	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑅 ∈ Rng)
26	1, 2, 3, 4, 5, 6, 7	rngqiprng1elbas 21175	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 1 ∈ 𝐵)
27	26	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 1 ∈ 𝐵)
28	5, 6	rngcl 20103	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑅 ∈ Rng ∧ 1 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ 𝐵)
29	25, 27, 24, 28	syl3anc 1368	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ 𝐵)
30		eqid 2725	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (-_g‘𝑅) = (-_g‘𝑅)
31	5, 30	grpsubcl 18975	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑅 ∈ Grp ∧ 𝑐 ∈ 𝐵 ∧ ( 1 · 𝑐) ∈ 𝐵) → (𝑐(-_g‘𝑅)( 1 · 𝑐)) ∈ 𝐵)
32	23, 24, 29, 31	syl3anc 1368	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑐(-_g‘𝑅)( 1 · 𝑐)) ∈ 𝐵)
33		eqid 2725	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (2Ideal‘𝑅) = (2Ideal‘𝑅)
34	5, 33	2idlss 21155	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → 𝐼 ⊆ 𝐵)
35	2, 34	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐼 ⊆ 𝐵)
36	35	sselda 3973	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼) → 𝑞 ∈ 𝐵)
37	36	adantr 479	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 ∈ 𝐵)
38	5, 20, 23, 32, 37	grpcld 18903	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) ∈ 𝐵)
39	38	adantr 479	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) ∈ 𝐵)
40		opeq1 4870	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 = [𝑐] ∼ → ⟨𝑝, 𝑞⟩ = ⟨[𝑐] ∼ , 𝑞⟩)
41	40	adantl 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ⟨𝑝, 𝑞⟩ = ⟨[𝑐] ∼ , 𝑞⟩)
42		eceq1 8756	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) → [𝑎] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ )
43		oveq2 7421	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) → ( 1 · 𝑎) = ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)))
44	42, 43	opeq12d 4878	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) → ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩)
45	41, 44	eqeqan12d 2739	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) ∧ 𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)) → (⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ↔ ⟨[𝑐] ∼ , 𝑞⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩))
46		rngabl 20094	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
47	1, 46	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 𝑅 ∈ Abel)
48	47	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑅 ∈ Abel)
49	5, 20, 30	ablsubaddsub 19768	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑅 ∈ Abel ∧ (𝑐 ∈ 𝐵 ∧ ( 1 · 𝑐) ∈ 𝐵 ∧ 𝑞 ∈ 𝐵)) → (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) = (𝑞(-_g‘𝑅)( 1 · 𝑐)))
50	48, 24, 29, 37, 49	syl13anc 1369	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) = (𝑞(-_g‘𝑅)( 1 · 𝑐)))
51	4	ringgrpd 20181	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐽 ∈ Grp)
52	51	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝐽 ∈ Grp)
53		eqid 2725	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Base‘𝐽) = (Base‘𝐽)
54	2, 3, 53	2idlbas 21156	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → (Base‘𝐽) = 𝐼)
55	54	eqcomd 2731	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝐼 = (Base‘𝐽))
56	55	eleq2d 2811	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝑞 ∈ 𝐼 ↔ 𝑞 ∈ (Base‘𝐽)))
57	56	biimpa 475	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼) → 𝑞 ∈ (Base‘𝐽))
58	57	adantr 479	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 ∈ (Base‘𝐽))
59	1, 2, 3, 4, 5, 6, 7	rngqiprngghmlem1 21176	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ (Base‘𝐽))
60	59	adantlr 713	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ (Base‘𝐽))
61		eqid 2725	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (-_g‘𝐽) = (-_g‘𝐽)
62	53, 61	grpsubcl 18975	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐽 ∈ Grp ∧ 𝑞 ∈ (Base‘𝐽) ∧ ( 1 · 𝑐) ∈ (Base‘𝐽)) → (𝑞(-_g‘𝐽)( 1 · 𝑐)) ∈ (Base‘𝐽))
63	52, 58, 60, 62	syl3anc 1368	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑞(-_g‘𝐽)( 1 · 𝑐)) ∈ (Base‘𝐽))
64		ringrng 20220	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
65	4, 64	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → 𝐽 ∈ Rng)
66	3, 65	eqeltrrid 2830	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → (𝑅 ↾_s 𝐼) ∈ Rng)
67	1, 2, 66	rng2idlnsg 21159	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
68		nsgsubg 19112	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐼 ∈ (NrmSGrp‘𝑅) → 𝐼 ∈ (SubGrp‘𝑅))
69	67, 68	syl 17	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐼 ∈ (SubGrp‘𝑅))
70	69	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝐼 ∈ (SubGrp‘𝑅))
71		simplr 767	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 ∈ 𝐼)
72	54	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (Base‘𝐽) = 𝐼)
73	60, 72	eleqtrd 2827	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ 𝐼)
74	30, 3, 61	subgsub 19092	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐼 ∈ (SubGrp‘𝑅) ∧ 𝑞 ∈ 𝐼 ∧ ( 1 · 𝑐) ∈ 𝐼) → (𝑞(-_g‘𝑅)( 1 · 𝑐)) = (𝑞(-_g‘𝐽)( 1 · 𝑐)))
75	70, 71, 73, 74	syl3anc 1368	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑞(-_g‘𝑅)( 1 · 𝑐)) = (𝑞(-_g‘𝐽)( 1 · 𝑐)))
76	55	ad2antrr 724	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝐼 = (Base‘𝐽))
77	63, 75, 76	3eltr4d 2840	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑞(-_g‘𝑅)( 1 · 𝑐)) ∈ 𝐼)
78	50, 77	eqeltrd 2825	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) ∈ 𝐼)
79	5, 30, 8	qusecsub 19789	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ Abel ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑐 ∈ 𝐵 ∧ ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) ∈ 𝐵)) → ([𝑐] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ ↔ (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) ∈ 𝐼))
80	48, 70, 24, 38, 79	syl22anc 837	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ([𝑐] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ ↔ (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) ∈ 𝐼))
81	78, 80	mpbird 256	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → [𝑐] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ )
82	1, 2, 3, 4, 5, 6, 7	rngqiprngimfolem 21179	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼 ∧ 𝑐 ∈ 𝐵) → ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)) = 𝑞)
83	82	3expa 1115	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)) = 𝑞)
84	83	eqcomd 2731	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 = ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)))
85	81, 84	opeq12d 4878	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ⟨[𝑐] ∼ , 𝑞⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩)
86	85	adantr 479	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ⟨[𝑐] ∼ , 𝑞⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩)
87	39, 45, 86	rspcedvd 3605	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
88	87	rexlimdva2 3147	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼) → (∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
89	88	ex 411	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑞 ∈ 𝐼 → (∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)))
90	89	com23 86	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ → (𝑞 ∈ 𝐼 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)))
91	19, 90	sylbid 239	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑝 ∈ 𝐶 → (𝑞 ∈ 𝐼 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)))
92	91	impd 409	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼) → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
93	92	com12 32	. . . . . . . . . 10 ⊢ ((𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼) → (𝜑 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
94	93	adantl 480	. . . . . . . . 9 ⊢ ((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) → (𝜑 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
95	94	imp 405	. . . . . . . 8 ⊢ (((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
96		simplll 773	. . . . . . . . . 10 ⊢ ((((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) ∧ 𝑎 ∈ 𝐵) → 𝑏 = ⟨𝑝, 𝑞⟩)
97	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	rngqiprngimfv 21187	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
98	97	adantll 712	. . . . . . . . . 10 ⊢ ((((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) ∧ 𝑎 ∈ 𝐵) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
99	96, 98	eqeq12d 2741	. . . . . . . . 9 ⊢ ((((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) ∧ 𝑎 ∈ 𝐵) → (𝑏 = (𝐹‘𝑎) ↔ ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
100	99	rexbidva 3167	. . . . . . . 8 ⊢ (((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) → (∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎) ↔ ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
101	95, 100	mpbird 256	. . . . . . 7 ⊢ (((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎))
102	101	ex 411	. . . . . 6 ⊢ ((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) → (𝜑 → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
103	102	exlimivv 1927	. . . . 5 ⊢ (∃𝑝∃𝑞(𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) → (𝜑 → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
104	14, 103	syl 17	. . . 4 ⊢ (𝑏 ∈ (𝐶 × 𝐼) → (𝜑 → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
105	104	impcom 406	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ (𝐶 × 𝐼)) → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎))
106	105	ralrimiva 3136	. 2 ⊢ (𝜑 → ∀𝑏 ∈ (𝐶 × 𝐼)∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎))
107		dffo3 7105	. 2 ⊢ (𝐹:𝐵–onto→(𝐶 × 𝐼) ↔ (𝐹:𝐵⟶(𝐶 × 𝐼) ∧ ∀𝑏 ∈ (𝐶 × 𝐼)∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
108	13, 106, 107	sylanbrc 581	1 ⊢ (𝜑 → 𝐹:𝐵–onto→(𝐶 × 𝐼))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∃wex 1773 ∈ wcel 2098 ∀wral 3051 ∃wrex 3060 Vcvv 3463 ⊆ wss 3941 ⟨cop 4631 ↦ cmpt 5227 × cxp 5671 ⟶wf 6539 –onto→wfo 6541 ‘cfv 6543 (class class class)co 7413 [cec 8716 Basecbs 17174 ↾_s cress 17203 +_gcplusg 17227 ._rcmulr 17228 /_s cqus 17481 ×_s cxps 17482 Grpcgrp 18889 -_gcsg 18891 SubGrpcsubg 19074 NrmSGrpcnsg 19075 ~_QG cqg 19076 Abelcabl 19735 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 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5281 ax-sep 5295 ax-nul 5302 ax-pow 5360 ax-pr 5424 ax-un 7735 ax-cnex 11189 ax-resscn 11190 ax-1cn 11191 ax-icn 11192 ax-addcl 11193 ax-addrcl 11194 ax-mulcl 11195 ax-mulrcl 11196 ax-mulcom 11197 ax-addass 11198 ax-mulass 11199 ax-distr 11200 ax-i2m1 11201 ax-1ne0 11202 ax-1rid 11203 ax-rnegex 11204 ax-rrecex 11205 ax-cnre 11206 ax-pre-lttri 11207 ax-pre-lttrn 11208 ax-pre-ltadd 11209 ax-pre-mulgt0 11210

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3771 df-csb 3887 df-dif 3944 df-un 3946 df-in 3948 df-ss 3958 df-pss 3961 df-nul 4320 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-tp 4630 df-op 4632 df-uni 4905 df-iun 4994 df-br 5145 df-opab 5207 df-mpt 5228 df-tr 5262 df-id 5571 df-eprel 5577 df-po 5585 df-so 5586 df-fr 5628 df-we 5630 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7866 df-1st 7987 df-2nd 7988 df-tpos 8225 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8718 df-ec 8720 df-qs 8724 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9460 df-inf 9461 df-pnf 11275 df-mnf 11276 df-xr 11277 df-ltxr 11278 df-le 11279 df-sub 11471 df-neg 11472 df-nn 12238 df-2 12300 df-3 12301 df-4 12302 df-5 12303 df-6 12304 df-7 12305 df-8 12306 df-9 12307 df-n0 12498 df-z 12584 df-dec 12703 df-uz 12848 df-fz 13512 df-struct 17110 df-sets 17127 df-slot 17145 df-ndx 17157 df-base 17175 df-ress 17204 df-plusg 17240 df-mulr 17241 df-sca 17243 df-vsca 17244 df-ip 17245 df-tset 17246 df-ple 17247 df-ds 17249 df-0g 17417 df-imas 17484 df-qus 17485 df-mgm 18594 df-sgrp 18673 df-mnd 18689 df-grp 18892 df-minusg 18893 df-sbg 18894 df-subg 19077 df-nsg 19078 df-eqg 19079 df-cmn 19736 df-abl 19737 df-mgp 20074 df-rng 20092 df-ur 20121 df-ring 20174 df-oppr 20272 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

W3C validator