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 21180

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 21176	. 2 ⊢ (𝜑 → 𝐹:𝐵⟶(𝐶 × 𝐼))
14		elxpi 5694	. . . . 5 ⊢ (𝑏 ∈ (𝐶 × 𝐼) → ∃𝑝∃𝑞(𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)))
15	10	eleq2i 2820	. . . . . . . . . . . . . 14 ⊢ (𝑝 ∈ 𝐶 ↔ 𝑝 ∈ (Base‘𝑄))
16		vex 3473	. . . . . . . . . . . . . . 15 ⊢ 𝑝 ∈ V
17	8, 9, 5	quselbas 19130	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ Rng ∧ 𝑝 ∈ V) → (𝑝 ∈ (Base‘𝑄) ↔ ∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ ))
18	1, 16, 17	sylancl 585	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑝 ∈ (Base‘𝑄) ↔ ∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ ))
19	15, 18	bitrid 283	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑝 ∈ 𝐶 ↔ ∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ ))
20		eqid 2727	. . . . . . . . . . . . . . . . . . 19 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
21		rnggrp 20089	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp)
22	1, 21	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝜑 → 𝑅 ∈ Grp)
23	22	ad2antrr 725	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑅 ∈ Grp)
24		simpr 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑐 ∈ 𝐵)
25	1	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑅 ∈ Rng)
26	1, 2, 3, 4, 5, 6, 7	rngqiprng1elbas 21165	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝜑 → 1 ∈ 𝐵)
27	26	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 1 ∈ 𝐵)
28	5, 6	rngcl 20095	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑅 ∈ Rng ∧ 1 ∈ 𝐵 ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ 𝐵)
29	25, 27, 24, 28	syl3anc 1369	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ 𝐵)
30		eqid 2727	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (-_g‘𝑅) = (-_g‘𝑅)
31	5, 30	grpsubcl 18967	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑅 ∈ Grp ∧ 𝑐 ∈ 𝐵 ∧ ( 1 · 𝑐) ∈ 𝐵) → (𝑐(-_g‘𝑅)( 1 · 𝑐)) ∈ 𝐵)
32	23, 24, 29, 31	syl3anc 1369	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑐(-_g‘𝑅)( 1 · 𝑐)) ∈ 𝐵)
33		eqid 2727	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (2Ideal‘𝑅) = (2Ideal‘𝑅)
34	5, 33	2idlss 21145	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐼 ∈ (2Ideal‘𝑅) → 𝐼 ⊆ 𝐵)
35	2, 34	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝜑 → 𝐼 ⊆ 𝐵)
36	35	sselda 3978	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼) → 𝑞 ∈ 𝐵)
37	36	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 ∈ 𝐵)
38	5, 20, 23, 32, 37	grpcld 18895	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) ∈ 𝐵)
39	38	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) ∈ 𝐵)
40		opeq1 4869	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑝 = [𝑐] ∼ → ⟨𝑝, 𝑞⟩ = ⟨[𝑐] ∼ , 𝑞⟩)
41	40	adantl 481	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ⟨𝑝, 𝑞⟩ = ⟨[𝑐] ∼ , 𝑞⟩)
42		eceq1 8756	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) → [𝑎] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ )
43		oveq2 7422	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) → ( 1 · 𝑎) = ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)))
44	42, 43	opeq12d 4877	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) → ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩)
45	41, 44	eqeqan12d 2741	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) ∧ 𝑎 = ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)) → (⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩ ↔ ⟨[𝑐] ∼ , 𝑞⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩))
46		rngabl 20086	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel)
47	1, 46	syl 17	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝜑 → 𝑅 ∈ Abel)
48	47	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑅 ∈ Abel)
49	5, 20, 30	ablsubaddsub 19760	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑅 ∈ Abel ∧ (𝑐 ∈ 𝐵 ∧ ( 1 · 𝑐) ∈ 𝐵 ∧ 𝑞 ∈ 𝐵)) → (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) = (𝑞(-_g‘𝑅)( 1 · 𝑐)))
50	48, 24, 29, 37, 49	syl13anc 1370	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) = (𝑞(-_g‘𝑅)( 1 · 𝑐)))
51	4	ringgrpd 20173	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐽 ∈ Grp)
52	51	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝐽 ∈ Grp)
53		eqid 2727	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Base‘𝐽) = (Base‘𝐽)
54	2, 3, 53	2idlbas 21146	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → (Base‘𝐽) = 𝐼)
55	54	eqcomd 2733	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝐼 = (Base‘𝐽))
56	55	eleq2d 2814	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝑞 ∈ 𝐼 ↔ 𝑞 ∈ (Base‘𝐽)))
57	56	biimpa 476	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼) → 𝑞 ∈ (Base‘𝐽))
58	57	adantr 480	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 ∈ (Base‘𝐽))
59	1, 2, 3, 4, 5, 6, 7	rngqiprngghmlem1 21166	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝜑 ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ (Base‘𝐽))
60	59	adantlr 714	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ (Base‘𝐽))
61		eqid 2727	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (-_g‘𝐽) = (-_g‘𝐽)
62	53, 61	grpsubcl 18967	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐽 ∈ Grp ∧ 𝑞 ∈ (Base‘𝐽) ∧ ( 1 · 𝑐) ∈ (Base‘𝐽)) → (𝑞(-_g‘𝐽)( 1 · 𝑐)) ∈ (Base‘𝐽))
63	52, 58, 60, 62	syl3anc 1369	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑞(-_g‘𝐽)( 1 · 𝑐)) ∈ (Base‘𝐽))
64		ringrng 20210	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (𝐽 ∈ Ring → 𝐽 ∈ Rng)
65	4, 64	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝜑 → 𝐽 ∈ Rng)
66	3, 65	eqeltrrid 2833	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → (𝑅 ↾_s 𝐼) ∈ Rng)
67	1, 2, 66	rng2idlnsg 21149	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → 𝐼 ∈ (NrmSGrp‘𝑅))
68		nsgsubg 19104	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐼 ∈ (NrmSGrp‘𝑅) → 𝐼 ∈ (SubGrp‘𝑅))
69	67, 68	syl 17	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (𝜑 → 𝐼 ∈ (SubGrp‘𝑅))
70	69	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝐼 ∈ (SubGrp‘𝑅))
71		simplr 768	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 ∈ 𝐼)
72	54	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (Base‘𝐽) = 𝐼)
73	60, 72	eleqtrd 2830	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · 𝑐) ∈ 𝐼)
74	30, 3, 61	subgsub 19084	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐼 ∈ (SubGrp‘𝑅) ∧ 𝑞 ∈ 𝐼 ∧ ( 1 · 𝑐) ∈ 𝐼) → (𝑞(-_g‘𝑅)( 1 · 𝑐)) = (𝑞(-_g‘𝐽)( 1 · 𝑐)))
75	70, 71, 73, 74	syl3anc 1369	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑞(-_g‘𝑅)( 1 · 𝑐)) = (𝑞(-_g‘𝐽)( 1 · 𝑐)))
76	55	ad2antrr 725	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝐼 = (Base‘𝐽))
77	63, 75, 76	3eltr4d 2843	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (𝑞(-_g‘𝑅)( 1 · 𝑐)) ∈ 𝐼)
78	50, 77	eqeltrd 2828	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) ∈ 𝐼)
79	5, 30, 8	qusecsub 19781	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑅 ∈ Abel ∧ 𝐼 ∈ (SubGrp‘𝑅)) ∧ (𝑐 ∈ 𝐵 ∧ ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞) ∈ 𝐵)) → ([𝑐] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ ↔ (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) ∈ 𝐼))
80	48, 70, 24, 38, 79	syl22anc 838	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ([𝑐] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ ↔ (((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)(-_g‘𝑅)𝑐) ∈ 𝐼))
81	78, 80	mpbird 257	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → [𝑐] ∼ = [((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ )
82	1, 2, 3, 4, 5, 6, 7	rngqiprngimfolem 21169	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼 ∧ 𝑐 ∈ 𝐵) → ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)) = 𝑞)
83	82	3expa 1116	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)) = 𝑞)
84	83	eqcomd 2733	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → 𝑞 = ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)))
85	81, 84	opeq12d 4877	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) → ⟨[𝑐] ∼ , 𝑞⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩)
86	85	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ⟨[𝑐] ∼ , 𝑞⟩ = ⟨[((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞)] ∼ , ( 1 · ((𝑐(-_g‘𝑅)( 1 · 𝑐))(+_g‘𝑅)𝑞))⟩)
87	39, 45, 86	rspcedvd 3609	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑞 ∈ 𝐼) ∧ 𝑐 ∈ 𝐵) ∧ 𝑝 = [𝑐] ∼ ) → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
88	87	rexlimdva2 3152	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑞 ∈ 𝐼) → (∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
89	88	ex 412	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑞 ∈ 𝐼 → (∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)))
90	89	com23 86	. . . . . . . . . . . . 13 ⊢ (𝜑 → (∃𝑐 ∈ 𝐵 𝑝 = [𝑐] ∼ → (𝑞 ∈ 𝐼 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)))
91	19, 90	sylbid 239	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑝 ∈ 𝐶 → (𝑞 ∈ 𝐼 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)))
92	91	impd 410	. . . . . . . . . . 11 ⊢ (𝜑 → ((𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼) → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
93	92	com12 32	. . . . . . . . . 10 ⊢ ((𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼) → (𝜑 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
94	93	adantl 481	. . . . . . . . 9 ⊢ ((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) → (𝜑 → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
95	94	imp 406	. . . . . . . 8 ⊢ (((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) → ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
96		simplll 774	. . . . . . . . . 10 ⊢ ((((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) ∧ 𝑎 ∈ 𝐵) → 𝑏 = ⟨𝑝, 𝑞⟩)
97	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	rngqiprngimfv 21177	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝐵) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
98	97	adantll 713	. . . . . . . . . 10 ⊢ ((((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) ∧ 𝑎 ∈ 𝐵) → (𝐹‘𝑎) = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩)
99	96, 98	eqeq12d 2743	. . . . . . . . 9 ⊢ ((((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) ∧ 𝑎 ∈ 𝐵) → (𝑏 = (𝐹‘𝑎) ↔ ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
100	99	rexbidva 3171	. . . . . . . 8 ⊢ (((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) → (∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎) ↔ ∃𝑎 ∈ 𝐵 ⟨𝑝, 𝑞⟩ = ⟨[𝑎] ∼ , ( 1 · 𝑎)⟩))
101	95, 100	mpbird 257	. . . . . . 7 ⊢ (((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) ∧ 𝜑) → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎))
102	101	ex 412	. . . . . 6 ⊢ ((𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) → (𝜑 → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
103	102	exlimivv 1928	. . . . 5 ⊢ (∃𝑝∃𝑞(𝑏 = ⟨𝑝, 𝑞⟩ ∧ (𝑝 ∈ 𝐶 ∧ 𝑞 ∈ 𝐼)) → (𝜑 → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
104	14, 103	syl 17	. . . 4 ⊢ (𝑏 ∈ (𝐶 × 𝐼) → (𝜑 → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
105	104	impcom 407	. . 3 ⊢ ((𝜑 ∧ 𝑏 ∈ (𝐶 × 𝐼)) → ∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎))
106	105	ralrimiva 3141	. 2 ⊢ (𝜑 → ∀𝑏 ∈ (𝐶 × 𝐼)∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎))
107		dffo3 7106	. 2 ⊢ (𝐹:𝐵–onto→(𝐶 × 𝐼) ↔ (𝐹:𝐵⟶(𝐶 × 𝐼) ∧ ∀𝑏 ∈ (𝐶 × 𝐼)∃𝑎 ∈ 𝐵 𝑏 = (𝐹‘𝑎)))
108	13, 106, 107	sylanbrc 582	1 ⊢ (𝜑 → 𝐹:𝐵–onto→(𝐶 × 𝐼))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1534 ∃wex 1774 ∈ wcel 2099 ∀wral 3056 ∃wrex 3065 Vcvv 3469 ⊆ wss 3944 ⟨cop 4630 ↦ cmpt 5225 × cxp 5670 ⟶wf 6538 –onto→wfo 6540 ‘cfv 6542 (class class class)co 7414 [cec 8716 Basecbs 17171 ↾_s cress 17200 +_gcplusg 17224 ._rcmulr 17225 /_s cqus 17478 ×_s cxps 17479 Grpcgrp 18881 -_gcsg 18883 SubGrpcsubg 19066 NrmSGrpcnsg 19067 ~_QG cqg 19068 Abelcabl 19727 Rngcrng 20083 1_rcur 20112 Ringcrg 20164 2Idealc2idl 21132

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 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207

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 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 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 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-sup 9457 df-inf 9458 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-nn 12235 df-2 12297 df-3 12298 df-4 12299 df-5 12300 df-6 12301 df-7 12302 df-8 12303 df-9 12304 df-n0 12495 df-z 12581 df-dec 12700 df-uz 12845 df-fz 13509 df-struct 17107 df-sets 17124 df-slot 17142 df-ndx 17154 df-base 17172 df-ress 17201 df-plusg 17237 df-mulr 17238 df-sca 17240 df-vsca 17241 df-ip 17242 df-tset 17243 df-ple 17244 df-ds 17246 df-0g 17414 df-imas 17481 df-qus 17482 df-mgm 18591 df-sgrp 18670 df-mnd 18686 df-grp 18884 df-minusg 18885 df-sbg 18886 df-subg 19069 df-nsg 19070 df-eqg 19071 df-cmn 19728 df-abl 19729 df-mgp 20066 df-rng 20084 df-ur 20113 df-ring 20166 df-oppr 20262 df-subrng 20472 df-lss 20805 df-sra 21047 df-rgmod 21048 df-lidl 21093 df-2idl 21133

This theorem is referenced by: rngqiprngim 21183

W3C validator