Theorem rhmqusspan 42876

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 20328	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ Ring)
9		rhmqusspan.8	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐺))
10		eqid 2769	. . . . . . . . . . . . . . 15 ⊢ (Base‘𝐺) = (Base‘𝐺)
11		eqid 2769	. . . . . . . . . . . . . . 15 ⊢ (RSpan‘𝐺) = (RSpan‘𝐺)
12		eqid 2769	. . . . . . . . . . . . . . 15 ⊢ (∥r‘𝐺) = (∥r‘𝐺)
13	10, 11, 12	rspsn 21470	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Ring ∧ 𝑋 ∈ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) = {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
14	8, 9, 13	syl2anc 595	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) = {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
15	14	eleq2d 2855	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) ↔ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}))
16	15	biimpd 232	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) → 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}))
17	16	imp 411	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
18		vex 3467	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
19	18	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑥 ∈ V)
20		breq2 5117	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑥 → (𝑋(∥r‘𝐺)𝑦 ↔ 𝑋(∥r‘𝐺)𝑥))
21	20	elabg 3644	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ V → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} ↔ 𝑋(∥r‘𝐺)𝑥))
22	21	biimpd 232	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ V → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → 𝑋(∥r‘𝐺)𝑥))
23	19, 22	syl 18	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → 𝑋(∥r‘𝐺)𝑥))
24	23	imp 411	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → 𝑋(∥r‘𝐺)𝑥)
25		eqid 2769	. . . . . . . . . . . . . . . . . 18 ⊢ (.r‘𝐺) = (.r‘𝐺)
26	10, 12, 25	dvdsr 20444	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋(∥r‘𝐺)𝑥 ↔ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥))
27	26	bilani 509	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥))
28		fveq2 6882	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑧(.r‘𝐺)𝑋) = 𝑥 → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = (𝐹‘𝑥))
29	28	eqcomd 2775	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑧(.r‘𝐺)𝑋) = 𝑥 → (𝐹‘𝑥) = (𝐹‘(𝑧(.r‘𝐺)𝑋)))
30	29	adantl 486	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = (𝐹‘(𝑧(.r‘𝐺)𝑋)))
31	2	ad2antrr 738	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 RingHom 𝐻))
32		simpr 489	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝑧 ∈ (Base‘𝐺))
33	9	ad2antrr 738	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝑋 ∈ (Base‘𝐺))
34		eqid 2769	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (.r‘𝐻) = (.r‘𝐻)
35	10, 25, 34	rhmmul 20568	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹 ∈ (𝐺 RingHom 𝐻) ∧ 𝑧 ∈ (Base‘𝐺) ∧ 𝑋 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)))
36	31, 32, 33, 35	syl3anc 1396	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)))
37		rhmqusspan.9	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝐹‘𝑋) = 0 )
38	37	ad2antrr 738	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘𝑋) = 0 )
39	38	oveq2d 7427	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)) = ((𝐹‘𝑧)(.r‘𝐻) 0 ))
40		rhmrcl2 20559	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐻 ∈ Ring)
41		ringsrg 20380	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐻 ∈ Ring → 𝐻 ∈ SRing)
42	31, 40, 41	3syl 19	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝐻 ∈ SRing)
43		eqid 2769	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Base‘𝐻) = (Base‘𝐻)
44	10, 43	rhmf 20566	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
45	2, 44	syl 18	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
46	45	adantr 485	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
47	46	ffvelcdmda 7080	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘𝑧) ∈ (Base‘𝐻))
48	43, 34, 1	srgrz 20289	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐻 ∈ SRing ∧ (𝐹‘𝑧) ∈ (Base‘𝐻)) → ((𝐹‘𝑧)(.r‘𝐻) 0 ) = 0 )
49	42, 47, 48	syl2anc 595	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻) 0 ) = 0 )
50	39, 49	eqtrd 2804	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)) = 0 )
51	36, 50	eqtrd 2804	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = 0 )
52	51	adantr 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = 0 )
53	30, 52	eqtrd 2804	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 )
54		nfv 1941	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑧(𝑦(.r‘𝐺)𝑋) = 𝑥
55		nfv 1941	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑦(𝑧(.r‘𝐺)𝑋) = 𝑥
56		oveq1 7418	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 = 𝑧 → (𝑦(.r‘𝐺)𝑋) = (𝑧(.r‘𝐺)𝑋))
57	56	eqeq1d 2771	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 = 𝑧 → ((𝑦(.r‘𝐺)𝑋) = 𝑥 ↔ (𝑧(.r‘𝐺)𝑋) = 𝑥))
58	54, 55, 57	cbvrexw 3314	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥 ↔ ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
59	58	bilani 509	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
60	59	adantl 486	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
61	53, 60	r19.29a 3179	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → (𝐹‘𝑥) = 0 )
62	61	ex 417	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 ))
63	62	adantr 485	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 ))
64	27, 63	mpd 16	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → (𝐹‘𝑥) = 0 )
65	64	ex 417	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋(∥r‘𝐺)𝑥 → (𝐹‘𝑥) = 0 ))
66	65	adantr 485	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → (𝑋(∥r‘𝐺)𝑥 → (𝐹‘𝑥) = 0 ))
67	24, 66	mpd 16	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → (𝐹‘𝑥) = 0 )
68	67	ex 417	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → (𝐹‘𝑥) = 0 ))
69	68	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → (𝐹‘𝑥) = 0 ))
70	17, 69	mpd 16	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) = 0 )
71		fvexd 6897	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) ∈ V)
72		elsng 4608	. . . . . . . . . 10 ⊢ ((𝐹‘𝑥) ∈ V → ((𝐹‘𝑥) ∈ { 0 } ↔ (𝐹‘𝑥) = 0 ))
73	71, 72	syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → ((𝐹‘𝑥) ∈ { 0 } ↔ (𝐹‘𝑥) = 0 ))
74	70, 73	mpbird 260	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) ∈ { 0 })
75	45	ffund 6711	. . . . . . . . . 10 ⊢ (𝜑 → Fun 𝐹)
76	75	adantr 485	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → Fun 𝐹)
77		eqid 2769	. . . . . . . . . . . . . 14 ⊢ (LIdeal‘𝐺) = (LIdeal‘𝐺)
78	77, 10	lidl1 21337	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Ring → (Base‘𝐺) ∈ (LIdeal‘𝐺))
79	8, 78	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (Base‘𝐺) ∈ (LIdeal‘𝐺))
80	9	snssd 4757	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑋} ⊆ (Base‘𝐺))
81	11, 77	rspssp 21346	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Ring ∧ (Base‘𝐺) ∈ (LIdeal‘𝐺) ∧ {𝑋} ⊆ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) ⊆ (Base‘𝐺))
82	8, 79, 80, 81	syl3anc 1396	. . . . . . . . . . 11 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ (Base‘𝐺))
83	82	sselda 3945	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ (Base‘𝐺))
84		fdm 6716	. . . . . . . . . . . 12 ⊢ (𝐹:(Base‘𝐺)⟶(Base‘𝐻) → dom 𝐹 = (Base‘𝐺))
85	45, 84	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = (Base‘𝐺))
86	85	adantr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → dom 𝐹 = (Base‘𝐺))
87	83, 86	eleqtrrd 2872	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ dom 𝐹)
88		fvimacnv 7049	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ { 0 } ↔ 𝑥 ∈ (◡𝐹 “ { 0 })))
89	76, 87, 88	syl2anc 595	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → ((𝐹‘𝑥) ∈ { 0 } ↔ 𝑥 ∈ (◡𝐹 “ { 0 })))
90	74, 89	mpbid 235	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ (◡𝐹 “ { 0 }))
91	90	ex 417	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) → 𝑥 ∈ (◡𝐹 “ { 0 })))
92	91	ssrdv 3951	. . . . 5 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ (◡𝐹 “ { 0 }))
93	3	eqcomi 2778	. . . . 5 ⊢ (◡𝐹 “ { 0 }) = 𝐾
94	92, 93	sseqtrdi 3985	. . . 4 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ 𝐾)
95	7, 94	eqsstrid 3983	. . 3 ⊢ (𝜑 → 𝑁 ⊆ 𝐾)
96	11, 10, 77	rspcl 21342	. . . . 5 ⊢ ((𝐺 ∈ Ring ∧ {𝑋} ⊆ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) ∈ (LIdeal‘𝐺))
97	8, 80, 96	syl2anc 595	. . . 4 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ∈ (LIdeal‘𝐺))
98	7, 97	eqeltrid 2873	. . 3 ⊢ (𝜑 → 𝑁 ∈ (LIdeal‘𝐺))
99	1, 2, 3, 4, 5, 6, 95, 98	rhmqusnsg 21396	. 2 ⊢ (𝜑 → 𝐽 ∈ (𝑄 RingHom 𝐻))
100	2	adantr 485	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 RingHom 𝐻))
101		rhmghm 20565	. . . . 5 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
102	100, 101	syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
103	95	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑁 ⊆ 𝐾)
104		lidlnsg 21356	. . . . . 6 ⊢ ((𝐺 ∈ Ring ∧ 𝑁 ∈ (LIdeal‘𝐺)) → 𝑁 ∈ (NrmSGrp‘𝐺))
105	8, 98, 104	syl2anc 595	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))
106	105	adantr 485	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑁 ∈ (NrmSGrp‘𝐺))
107		simpr 489	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑔 ∈ (Base‘𝐺))
108	1, 102, 3, 4, 5, 103, 106, 107	ghmqusnsglem1 19350	. . 3 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → (𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔))
109	108	ralrimiva 3163	. 2 ⊢ (𝜑 → ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔))
110	99, 109	jca 520	1 ⊢ (𝜑 → (𝐽 ∈ (𝑄 RingHom 𝐻) ∧ ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1567   ∈ wcel 2149  {cab 2747  ∀wral 3085  ∃wrex 3095  Vcvv 3463   ⊆ wss 3913  {csn 4594  ∪ cuni 4876   class class class wbr 5113   ↦ cmpt 5196  ^◡ccnv 5661  dom cdm 5662   “ cima 5665  Fun wfun 6531  ⟶wf 6533  ‘cfv 6537  (class class class)co 7411  [cec 8692  Basecbs 17269  ._rcmulr 17311  0_gc0g 17492   /_s cqus 17559  NrmSGrpcnsg 19187   ~_QG cqg 19188   GrpHom cghm 19283  SRingcsrg 20268  Ringcrg 20315  CRingccrg 20316  ∥_rcdsr 20436   RingHom crh 20551  LIdealclidl 21308  RSpancrsp 21309

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733  ax-cnex 11156  ax-resscn 11157  ax-1cn 11158  ax-icn 11159  ax-addcl 11160  ax-addrcl 11161  ax-mulcl 11162  ax-mulrcl 11163  ax-mulcom 11164  ax-addass 11165  ax-mulass 11166  ax-distr 11167  ax-i2m1 11168  ax-1ne0 11169  ax-1rid 11170  ax-rnegex 11171  ax-rrecex 11172  ax-cnre 11173  ax-pre-lttri 11174  ax-pre-lttrn 11175  ax-pre-ltadd 11176  ax-pre-mulgt0 11177

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-nel 3071  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7368  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-tpos 8222  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-er 8694  df-ec 8696  df-qs 8700  df-map 8826  df-en 8944  df-dom 8945  df-sdom 8946  df-fin 8947  df-sup 9402  df-inf 9403  df-pnf 11245  df-mnf 11246  df-xr 11247  df-ltxr 11248  df-le 11249  df-sub 11443  df-neg 11444  df-nn 12234  df-2 12303  df-3 12304  df-4 12305  df-5 12306  df-6 12307  df-7 12308  df-8 12309  df-9 12310  df-n0 12505  df-z 12592  df-dec 12712  df-uz 12863  df-fz 13536  df-struct 17207  df-sets 17224  df-slot 17242  df-ndx 17254  df-base 17270  df-ress 17291  df-plusg 17323  df-mulr 17324  df-sca 17326  df-vsca 17327  df-ip 17328  df-tset 17329  df-ple 17330  df-ds 17332  df-0g 17494  df-imas 17562  df-qus 17563  df-mgm 18698  df-sgrp 18777  df-mnd 18793  df-mhm 18841  df-grp 19003  df-minusg 19004  df-sbg 19005  df-subg 19189  df-nsg 19190  df-eqg 19191  df-ghm 19284  df-cmn 19852  df-abl 19853  df-mgp 20217  df-rng 20231  df-ur 20264  df-srg 20269  df-ring 20317  df-cring 20318  df-oppr 20419  df-dvdsr 20439  df-rhm 20554  df-subrg 20655  df-lmod 20961  df-lss 21031  df-lsp 21071  df-sra 21272  df-rgmod 21273  df-lidl 21310  df-rsp 21311  df-2idl 21360

This theorem is referenced by:  aks5lem2  42878