Theorem rhmqusspan 42683

Description: Ring homomorphism out of a quotient given an ideal spanned by a singleton. (Contributed by metakunt, 7-Jun-2025.)

Hypotheses

Ref	Expression
rhmqusspan.1	⊢ 0 = (0g‘𝐻)
rhmqusspan.2	⊢ (𝜑 → 𝐹 ∈ (𝐺 RingHom 𝐻))
rhmqusspan.3	⊢ 𝐾 = (◡𝐹 “ { 0 })
rhmqusspan.4	⊢ 𝑄 = (𝐺 /s (𝐺 ~QG 𝑁))
rhmqusspan.5	⊢ 𝐽 = (𝑞 ∈ (Base‘𝑄) ↦ ∪ (𝐹 “ 𝑞))
rhmqusspan.6	⊢ (𝜑 → 𝐺 ∈ CRing)
rhmqusspan.7	⊢ 𝑁 = ((RSpan‘𝐺)‘{𝑋})
rhmqusspan.8	⊢ (𝜑 → 𝑋 ∈ (Base‘𝐺))
rhmqusspan.9	⊢ (𝜑 → (𝐹‘𝑋) = 0 )

Assertion

Ref	Expression
rhmqusspan	⊢ (𝜑 → (𝐽 ∈ (𝑄 RingHom 𝐻) ∧ ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔)))

Distinct variable groups:   𝐹,𝑞   𝐺,𝑞   𝐻,𝑞   𝐽,𝑞   𝐾,𝑞   𝑁,𝑞   𝑄,𝑞   𝜑,𝑔,𝑞

Allowed substitution hints:   𝑄(𝑔)   𝐹(𝑔)   𝐺(𝑔)   𝐻(𝑔)   𝐽(𝑔)   𝐾(𝑔)   𝑁(𝑔)   𝑋(𝑔,𝑞)   0 (𝑔,𝑞)

Proof of Theorem rhmqusspan

Dummy variables 𝑥 𝑧 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rhmqusspan.1	. . 3 ⊢ 0 = (0g‘𝐻)
2		rhmqusspan.2	. . 3 ⊢ (𝜑 → 𝐹 ∈ (𝐺 RingHom 𝐻))
3		rhmqusspan.3	. . 3 ⊢ 𝐾 = (◡𝐹 “ { 0 })
4		rhmqusspan.4	. . 3 ⊢ 𝑄 = (𝐺 /s (𝐺 ~QG 𝑁))
5		rhmqusspan.5	. . 3 ⊢ 𝐽 = (𝑞 ∈ (Base‘𝑄) ↦ ∪ (𝐹 “ 𝑞))
6		rhmqusspan.6	. . 3 ⊢ (𝜑 → 𝐺 ∈ CRing)
7		rhmqusspan.7	. . . 4 ⊢ 𝑁 = ((RSpan‘𝐺)‘{𝑋})
8	6	crngringd 20221	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ Ring)
9		rhmqusspan.8	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐺))
10		eqid 2741	. . . . . . . . . . . . . . 15 ⊢ (Base‘𝐺) = (Base‘𝐺)
11		eqid 2741	. . . . . . . . . . . . . . 15 ⊢ (RSpan‘𝐺) = (RSpan‘𝐺)
12		eqid 2741	. . . . . . . . . . . . . . 15 ⊢ (∥r‘𝐺) = (∥r‘𝐺)
13	10, 11, 12	rspsn 21329	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Ring ∧ 𝑋 ∈ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) = {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
14	8, 9, 13	syl2anc 591	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) = {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
15	14	eleq2d 2827	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) ↔ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}))
16	15	biimpd 231	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) → 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}))
17	16	imp 408	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
18		vex 3437	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
19	18	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑥 ∈ V)
20		breq2 5078	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑥 → (𝑋(∥r‘𝐺)𝑦 ↔ 𝑋(∥r‘𝐺)𝑥))
21	20	elabg 3615	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ V → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} ↔ 𝑋(∥r‘𝐺)𝑥))
22	21	biimpd 231	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ V → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → 𝑋(∥r‘𝐺)𝑥))
23	19, 22	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → 𝑋(∥r‘𝐺)𝑥))
24	23	imp 408	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → 𝑋(∥r‘𝐺)𝑥)
25		eqid 2741	. . . . . . . . . . . . . . . . . 18 ⊢ (.r‘𝐺) = (.r‘𝐺)
26	10, 12, 25	dvdsr 20336	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋(∥r‘𝐺)𝑥 ↔ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥))
27	26	bilani 506	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥))
28		fveq2 6830	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑧(.r‘𝐺)𝑋) = 𝑥 → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = (𝐹‘𝑥))
29	28	eqcomd 2747	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑧(.r‘𝐺)𝑋) = 𝑥 → (𝐹‘𝑥) = (𝐹‘(𝑧(.r‘𝐺)𝑋)))
30	29	adantl 483	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = (𝐹‘(𝑧(.r‘𝐺)𝑋)))
31	2	ad2antrr 733	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 RingHom 𝐻))
32		simpr 486	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝑧 ∈ (Base‘𝐺))
33	9	ad2antrr 733	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝑋 ∈ (Base‘𝐺))
34		eqid 2741	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (.r‘𝐻) = (.r‘𝐻)
35	10, 25, 34	rhmmul 20460	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹 ∈ (𝐺 RingHom 𝐻) ∧ 𝑧 ∈ (Base‘𝐺) ∧ 𝑋 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)))
36	31, 32, 33, 35	syl3anc 1380	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)))
37		rhmqusspan.9	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝐹‘𝑋) = 0 )
38	37	ad2antrr 733	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘𝑋) = 0 )
39	38	oveq2d 7375	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)) = ((𝐹‘𝑧)(.r‘𝐻) 0 ))
40		rhmrcl2 20451	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐻 ∈ Ring)
41		ringsrg 20272	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐻 ∈ Ring → 𝐻 ∈ SRing)
42	31, 40, 41	3syl 18	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝐻 ∈ SRing)
43		eqid 2741	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Base‘𝐻) = (Base‘𝐻)
44	10, 43	rhmf 20458	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
45	2, 44	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
46	45	adantr 482	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
47	46	ffvelcdmda 7028	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘𝑧) ∈ (Base‘𝐻))
48	43, 34, 1	srgrz 20182	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐻 ∈ SRing ∧ (𝐹‘𝑧) ∈ (Base‘𝐻)) → ((𝐹‘𝑧)(.r‘𝐻) 0 ) = 0 )
49	42, 47, 48	syl2anc 591	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻) 0 ) = 0 )
50	39, 49	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)) = 0 )
51	36, 50	eqtrd 2776	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = 0 )
52	51	adantr 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = 0 )
53	30, 52	eqtrd 2776	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 )
54		nfv 1922	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑧(𝑦(.r‘𝐺)𝑋) = 𝑥
55		nfv 1922	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑦(𝑧(.r‘𝐺)𝑋) = 𝑥
56		oveq1 7366	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 = 𝑧 → (𝑦(.r‘𝐺)𝑋) = (𝑧(.r‘𝐺)𝑋))
57	56	eqeq1d 2743	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 = 𝑧 → ((𝑦(.r‘𝐺)𝑋) = 𝑥 ↔ (𝑧(.r‘𝐺)𝑋) = 𝑥))
58	54, 55, 57	cbvrexw 3284	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥 ↔ ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
59	58	bilani 506	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
60	59	adantl 483	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
61	53, 60	r19.29a 3149	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → (𝐹‘𝑥) = 0 )
62	61	ex 414	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 ))
63	62	adantr 482	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 ))
64	27, 63	mpd 15	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → (𝐹‘𝑥) = 0 )
65	64	ex 414	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋(∥r‘𝐺)𝑥 → (𝐹‘𝑥) = 0 ))
66	65	adantr 482	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → (𝑋(∥r‘𝐺)𝑥 → (𝐹‘𝑥) = 0 ))
67	24, 66	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → (𝐹‘𝑥) = 0 )
68	67	ex 414	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → (𝐹‘𝑥) = 0 ))
69	68	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → (𝐹‘𝑥) = 0 ))
70	17, 69	mpd 15	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) = 0 )
71		fvexd 6845	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) ∈ V)
72		elsng 4571	. . . . . . . . . 10 ⊢ ((𝐹‘𝑥) ∈ V → ((𝐹‘𝑥) ∈ { 0 } ↔ (𝐹‘𝑥) = 0 ))
73	71, 72	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → ((𝐹‘𝑥) ∈ { 0 } ↔ (𝐹‘𝑥) = 0 ))
74	70, 73	mpbird 259	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) ∈ { 0 })
75	45	ffund 6662	. . . . . . . . . 10 ⊢ (𝜑 → Fun 𝐹)
76	75	adantr 482	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → Fun 𝐹)
77		eqid 2741	. . . . . . . . . . . . . 14 ⊢ (LIdeal‘𝐺) = (LIdeal‘𝐺)
78	77, 10	lidl1 21229	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Ring → (Base‘𝐺) ∈ (LIdeal‘𝐺))
79	8, 78	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (Base‘𝐺) ∈ (LIdeal‘𝐺))
80	9	snssd 4720	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑋} ⊆ (Base‘𝐺))
81	11, 77	rspssp 21235	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Ring ∧ (Base‘𝐺) ∈ (LIdeal‘𝐺) ∧ {𝑋} ⊆ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) ⊆ (Base‘𝐺))
82	8, 79, 80, 81	syl3anc 1380	. . . . . . . . . . 11 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ (Base‘𝐺))
83	82	sselda 3916	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ (Base‘𝐺))
84		fdm 6667	. . . . . . . . . . . 12 ⊢ (𝐹:(Base‘𝐺)⟶(Base‘𝐻) → dom 𝐹 = (Base‘𝐺))
85	45, 84	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = (Base‘𝐺))
86	85	adantr 482	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → dom 𝐹 = (Base‘𝐺))
87	83, 86	eleqtrrd 2844	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ dom 𝐹)
88		fvimacnv 6997	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ { 0 } ↔ 𝑥 ∈ (◡𝐹 “ { 0 })))
89	76, 87, 88	syl2anc 591	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → ((𝐹‘𝑥) ∈ { 0 } ↔ 𝑥 ∈ (◡𝐹 “ { 0 })))
90	74, 89	mpbid 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ (◡𝐹 “ { 0 }))
91	90	ex 414	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) → 𝑥 ∈ (◡𝐹 “ { 0 })))
92	91	ssrdv 3922	. . . . 5 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ (◡𝐹 “ { 0 }))
93	3	eqcomi 2750	. . . . 5 ⊢ (◡𝐹 “ { 0 }) = 𝐾
94	92, 93	sseqtrdi 3956	. . . 4 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ 𝐾)
95	7, 94	eqsstrid 3954	. . 3 ⊢ (𝜑 → 𝑁 ⊆ 𝐾)
96	11, 10, 77	rspcl 21231	. . . . 5 ⊢ ((𝐺 ∈ Ring ∧ {𝑋} ⊆ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) ∈ (LIdeal‘𝐺))
97	8, 80, 96	syl2anc 591	. . . 4 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ∈ (LIdeal‘𝐺))
98	7, 97	eqeltrid 2845	. . 3 ⊢ (𝜑 → 𝑁 ∈ (LIdeal‘𝐺))
99	1, 2, 3, 4, 5, 6, 95, 98	rhmqusnsg 21281	. 2 ⊢ (𝜑 → 𝐽 ∈ (𝑄 RingHom 𝐻))
100	2	adantr 482	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 RingHom 𝐻))
101		rhmghm 20457	. . . . 5 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
102	100, 101	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
103	95	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑁 ⊆ 𝐾)
104		lidlnsg 21244	. . . . . 6 ⊢ ((𝐺 ∈ Ring ∧ 𝑁 ∈ (LIdeal‘𝐺)) → 𝑁 ∈ (NrmSGrp‘𝐺))
105	8, 98, 104	syl2anc 591	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))
106	105	adantr 482	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑁 ∈ (NrmSGrp‘𝐺))
107		simpr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑔 ∈ (Base‘𝐺))
108	1, 102, 3, 4, 5, 103, 106, 107	ghmqusnsglem1 19249	. . 3 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → (𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔))
109	108	ralrimiva 3133	. 2 ⊢ (𝜑 → ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔))
110	99, 109	jca 517	1 ⊢ (𝜑 → (𝐽 ∈ (𝑄 RingHom 𝐻) ∧ ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 397   = wceq 1548   ∈ wcel 2121  {cab 2719  ∀wral 3055  ∃wrex 3065  Vcvv 3433   ⊆ wss 3884  {csn 4557  ∪ cuni 4840   class class class wbr 5074   ↦ cmpt 5155  ^◡ccnv 5619  dom cdm 5620   “ cima 5623  Fun wfun 6482  ⟶wf 6484  ‘cfv 6488  (class class class)co 7359  [cec 8635  Basecbs 17174  ._rcmulr 17216  0_gc0g 17397   /_s cqus 17464  NrmSGrpcnsg 19092   ~_QG cqg 19093   GrpHom cghm 19182  SRingcsrg 20161  Ringcrg 20208  CRingccrg 20209  ∥_rcdsr 20328   RingHom crh 20443  LIdealclidl 21202  RSpancrsp 21203

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-10 2154  ax-11 2170  ax-12 2191  ax-ext 2713  ax-rep 5201  ax-sep 5220  ax-nul 5230  ax-pow 5296  ax-pr 5364  ax-un 7681  ax-cnex 11090  ax-resscn 11091  ax-1cn 11092  ax-icn 11093  ax-addcl 11094  ax-addrcl 11095  ax-mulcl 11096  ax-mulrcl 11097  ax-mulcom 11098  ax-addass 11099  ax-mulass 11100  ax-distr 11101  ax-i2m1 11102  ax-1ne0 11103  ax-1rid 11104  ax-rnegex 11105  ax-rrecex 11106  ax-cnre 11107  ax-pre-lttri 11108  ax-pre-lttrn 11109  ax-pre-ltadd 11110  ax-pre-mulgt0 11111

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3or 1094  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-nf 1792  df-sb 2075  df-mo 2545  df-eu 2575  df-clab 2720  df-cleq 2733  df-clel 2816  df-nfc 2890  df-ne 2937  df-nel 3041  df-ral 3056  df-rex 3066  df-rmo 3346  df-reu 3347  df-rab 3394  df-v 3435  df-sbc 3725  df-csb 3833  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-pss 3904  df-nul 4264  df-if 4457  df-pw 4533  df-sn 4558  df-pr 4560  df-tp 4562  df-op 4564  df-uni 4841  df-int 4880  df-iun 4925  df-br 5075  df-opab 5137  df-mpt 5156  df-tr 5182  df-id 5515  df-eprel 5520  df-po 5528  df-so 5529  df-fr 5573  df-we 5575  df-xp 5626  df-rel 5627  df-cnv 5628  df-co 5629  df-dm 5630  df-rn 5631  df-res 5632  df-ima 5633  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-riota 7316  df-ov 7362  df-oprab 7363  df-mpo 7364  df-om 7810  df-1st 7933  df-2nd 7934  df-tpos 8168  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8343  df-1o 8399  df-er 8637  df-ec 8639  df-qs 8643  df-map 8769  df-en 8888  df-dom 8889  df-sdom 8890  df-fin 8891  df-sup 9349  df-inf 9350  df-pnf 11177  df-mnf 11178  df-xr 11179  df-ltxr 11180  df-le 11181  df-sub 11375  df-neg 11376  df-nn 12170  df-2 12239  df-3 12240  df-4 12241  df-5 12242  df-6 12243  df-7 12244  df-8 12245  df-9 12246  df-n0 12433  df-z 12520  df-dec 12640  df-uz 12784  df-fz 13457  df-struct 17112  df-sets 17129  df-slot 17147  df-ndx 17159  df-base 17175  df-ress 17196  df-plusg 17228  df-mulr 17229  df-sca 17231  df-vsca 17232  df-ip 17233  df-tset 17234  df-ple 17235  df-ds 17237  df-0g 17399  df-imas 17467  df-qus 17468  df-mgm 18603  df-sgrp 18682  df-mnd 18698  df-mhm 18746  df-grp 18907  df-minusg 18908  df-sbg 18909  df-subg 19094  df-nsg 19095  df-eqg 19096  df-ghm 19183  df-cmn 19751  df-abl 19752  df-mgp 20116  df-rng 20128  df-ur 20157  df-srg 20162  df-ring 20210  df-cring 20211  df-oppr 20311  df-dvdsr 20331  df-rhm 20446  df-subrg 20545  df-lmod 20855  df-lss 20925  df-lsp 20965  df-sra 21166  df-rgmod 21167  df-lidl 21204  df-rsp 21205  df-2idl 21246

This theorem is referenced by:  aks5lem2  42685