Theorem rhmqusspan 42807

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 20298	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐺 ∈ Ring)
9		rhmqusspan.8	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑋 ∈ (Base‘𝐺))
10		eqid 2764	. . . . . . . . . . . . . . 15 ⊢ (Base‘𝐺) = (Base‘𝐺)
11		eqid 2764	. . . . . . . . . . . . . . 15 ⊢ (RSpan‘𝐺) = (RSpan‘𝐺)
12		eqid 2764	. . . . . . . . . . . . . . 15 ⊢ (∥r‘𝐺) = (∥r‘𝐺)
13	10, 11, 12	rspsn 21405	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Ring ∧ 𝑋 ∈ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) = {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
14	8, 9, 13	syl2anc 593	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) = {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
15	14	eleq2d 2850	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) ↔ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}))
16	15	biimpd 231	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) → 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}))
17	16	imp 410	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦})
18		vex 3460	. . . . . . . . . . . . . . . 16 ⊢ 𝑥 ∈ V
19	18	a1i 11	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑥 ∈ V)
20		breq2 5106	. . . . . . . . . . . . . . . . 17 ⊢ (𝑦 = 𝑥 → (𝑋(∥r‘𝐺)𝑦 ↔ 𝑋(∥r‘𝐺)𝑥))
21	20	elabg 3637	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 ∈ V → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} ↔ 𝑋(∥r‘𝐺)𝑥))
22	21	biimpd 231	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ V → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → 𝑋(∥r‘𝐺)𝑥))
23	19, 22	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → 𝑋(∥r‘𝐺)𝑥))
24	23	imp 410	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → 𝑋(∥r‘𝐺)𝑥)
25		eqid 2764	. . . . . . . . . . . . . . . . . 18 ⊢ (.r‘𝐺) = (.r‘𝐺)
26	10, 12, 25	dvdsr 20413	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋(∥r‘𝐺)𝑥 ↔ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥))
27	26	bilani 508	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥))
28		fveq2 6869	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑧(.r‘𝐺)𝑋) = 𝑥 → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = (𝐹‘𝑥))
29	28	eqcomd 2770	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑧(.r‘𝐺)𝑋) = 𝑥 → (𝐹‘𝑥) = (𝐹‘(𝑧(.r‘𝐺)𝑋)))
30	29	adantl 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = (𝐹‘(𝑧(.r‘𝐺)𝑋)))
31	2	ad2antrr 736	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 RingHom 𝐻))
32		simpr 488	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝑧 ∈ (Base‘𝐺))
33	9	ad2antrr 736	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝑋 ∈ (Base‘𝐺))
34		eqid 2764	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (.r‘𝐻) = (.r‘𝐻)
35	10, 25, 34	rhmmul 20537	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝐹 ∈ (𝐺 RingHom 𝐻) ∧ 𝑧 ∈ (Base‘𝐺) ∧ 𝑋 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)))
36	31, 32, 33, 35	syl3anc 1392	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)))
37		rhmqusspan.9	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝜑 → (𝐹‘𝑋) = 0 )
38	37	ad2antrr 736	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘𝑋) = 0 )
39	38	oveq2d 7414	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)) = ((𝐹‘𝑧)(.r‘𝐻) 0 ))
40		rhmrcl2 20528	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐻 ∈ Ring)
41		ringsrg 20349	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐻 ∈ Ring → 𝐻 ∈ SRing)
42	31, 40, 41	3syl 18	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → 𝐻 ∈ SRing)
43		eqid 2764	. . . . . . . . . . . . . . . . . . . . . . . . . . . 28 ⊢ (Base‘𝐻) = (Base‘𝐻)
44	10, 43	rhmf 20535	. . . . . . . . . . . . . . . . . . . . . . . . . . 27 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
45	2, 44	syl 17	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝜑 → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
46	45	adantr 484	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → 𝐹:(Base‘𝐺)⟶(Base‘𝐻))
47	46	ffvelcdmda 7067	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘𝑧) ∈ (Base‘𝐻))
48	43, 34, 1	srgrz 20259	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝐻 ∈ SRing ∧ (𝐹‘𝑧) ∈ (Base‘𝐻)) → ((𝐹‘𝑧)(.r‘𝐻) 0 ) = 0 )
49	42, 47, 48	syl2anc 593	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻) 0 ) = 0 )
50	39, 49	eqtrd 2799	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → ((𝐹‘𝑧)(.r‘𝐻)(𝐹‘𝑋)) = 0 )
51	36, 50	eqtrd 2799	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = 0 )
52	51	adantr 484	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘(𝑧(.r‘𝐺)𝑋)) = 0 )
53	30, 52	eqtrd 2799	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) ∧ 𝑧 ∈ (Base‘𝐺)) ∧ (𝑧(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 )
54		nfv 1936	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑧(𝑦(.r‘𝐺)𝑋) = 𝑥
55		nfv 1936	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ Ⅎ𝑦(𝑧(.r‘𝐺)𝑋) = 𝑥
56		oveq1 7405	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑦 = 𝑧 → (𝑦(.r‘𝐺)𝑋) = (𝑧(.r‘𝐺)𝑋))
57	56	eqeq1d 2766	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑦 = 𝑧 → ((𝑦(.r‘𝐺)𝑋) = 𝑥 ↔ (𝑧(.r‘𝐺)𝑋) = 𝑥))
58	54, 55, 57	cbvrexw 3307	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥 ↔ ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
59	58	bilani 508	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
60	59	adantl 485	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → ∃𝑧 ∈ (Base‘𝐺)(𝑧(.r‘𝐺)𝑋) = 𝑥)
61	53, 60	r19.29a 3172	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝜑 ∧ (𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥)) → (𝐹‘𝑥) = 0 )
62	61	ex 416	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 ))
63	62	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → ((𝑋 ∈ (Base‘𝐺) ∧ ∃𝑦 ∈ (Base‘𝐺)(𝑦(.r‘𝐺)𝑋) = 𝑥) → (𝐹‘𝑥) = 0 ))
64	27, 63	mpd 15	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑋(∥r‘𝐺)𝑥) → (𝐹‘𝑥) = 0 )
65	64	ex 416	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑋(∥r‘𝐺)𝑥 → (𝐹‘𝑥) = 0 ))
66	65	adantr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → (𝑋(∥r‘𝐺)𝑥 → (𝐹‘𝑥) = 0 ))
67	24, 66	mpd 15	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦}) → (𝐹‘𝑥) = 0 )
68	67	ex 416	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → (𝐹‘𝑥) = 0 ))
69	68	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝑥 ∈ {𝑦 ∣ 𝑋(∥r‘𝐺)𝑦} → (𝐹‘𝑥) = 0 ))
70	17, 69	mpd 15	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) = 0 )
71		fvexd 6884	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) ∈ V)
72		elsng 4598	. . . . . . . . . 10 ⊢ ((𝐹‘𝑥) ∈ V → ((𝐹‘𝑥) ∈ { 0 } ↔ (𝐹‘𝑥) = 0 ))
73	71, 72	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → ((𝐹‘𝑥) ∈ { 0 } ↔ (𝐹‘𝑥) = 0 ))
74	70, 73	mpbird 259	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → (𝐹‘𝑥) ∈ { 0 })
75	45	ffund 6698	. . . . . . . . . 10 ⊢ (𝜑 → Fun 𝐹)
76	75	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → Fun 𝐹)
77		eqid 2764	. . . . . . . . . . . . . 14 ⊢ (LIdeal‘𝐺) = (LIdeal‘𝐺)
78	77, 10	lidl1 21305	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ Ring → (Base‘𝐺) ∈ (LIdeal‘𝐺))
79	8, 78	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (Base‘𝐺) ∈ (LIdeal‘𝐺))
80	9	snssd 4747	. . . . . . . . . . . 12 ⊢ (𝜑 → {𝑋} ⊆ (Base‘𝐺))
81	11, 77	rspssp 21311	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Ring ∧ (Base‘𝐺) ∈ (LIdeal‘𝐺) ∧ {𝑋} ⊆ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) ⊆ (Base‘𝐺))
82	8, 79, 80, 81	syl3anc 1392	. . . . . . . . . . 11 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ (Base‘𝐺))
83	82	sselda 3938	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ (Base‘𝐺))
84		fdm 6703	. . . . . . . . . . . 12 ⊢ (𝐹:(Base‘𝐺)⟶(Base‘𝐻) → dom 𝐹 = (Base‘𝐺))
85	45, 84	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → dom 𝐹 = (Base‘𝐺))
86	85	adantr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → dom 𝐹 = (Base‘𝐺))
87	83, 86	eleqtrrd 2867	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ dom 𝐹)
88		fvimacnv 7036	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ dom 𝐹) → ((𝐹‘𝑥) ∈ { 0 } ↔ 𝑥 ∈ (◡𝐹 “ { 0 })))
89	76, 87, 88	syl2anc 593	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → ((𝐹‘𝑥) ∈ { 0 } ↔ 𝑥 ∈ (◡𝐹 “ { 0 })))
90	74, 89	mpbid 234	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ((RSpan‘𝐺)‘{𝑋})) → 𝑥 ∈ (◡𝐹 “ { 0 }))
91	90	ex 416	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ ((RSpan‘𝐺)‘{𝑋}) → 𝑥 ∈ (◡𝐹 “ { 0 })))
92	91	ssrdv 3944	. . . . 5 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ (◡𝐹 “ { 0 }))
93	3	eqcomi 2773	. . . . 5 ⊢ (◡𝐹 “ { 0 }) = 𝐾
94	92, 93	sseqtrdi 3978	. . . 4 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ⊆ 𝐾)
95	7, 94	eqsstrid 3976	. . 3 ⊢ (𝜑 → 𝑁 ⊆ 𝐾)
96	11, 10, 77	rspcl 21307	. . . . 5 ⊢ ((𝐺 ∈ Ring ∧ {𝑋} ⊆ (Base‘𝐺)) → ((RSpan‘𝐺)‘{𝑋}) ∈ (LIdeal‘𝐺))
97	8, 80, 96	syl2anc 593	. . . 4 ⊢ (𝜑 → ((RSpan‘𝐺)‘{𝑋}) ∈ (LIdeal‘𝐺))
98	7, 97	eqeltrid 2868	. . 3 ⊢ (𝜑 → 𝑁 ∈ (LIdeal‘𝐺))
99	1, 2, 3, 4, 5, 6, 95, 98	rhmqusnsg 21357	. 2 ⊢ (𝜑 → 𝐽 ∈ (𝑄 RingHom 𝐻))
100	2	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 RingHom 𝐻))
101		rhmghm 20534	. . . . 5 ⊢ (𝐹 ∈ (𝐺 RingHom 𝐻) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
102	100, 101	syl 17	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝐹 ∈ (𝐺 GrpHom 𝐻))
103	95	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑁 ⊆ 𝐾)
104		lidlnsg 21320	. . . . . 6 ⊢ ((𝐺 ∈ Ring ∧ 𝑁 ∈ (LIdeal‘𝐺)) → 𝑁 ∈ (NrmSGrp‘𝐺))
105	8, 98, 104	syl2anc 593	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (NrmSGrp‘𝐺))
106	105	adantr 484	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑁 ∈ (NrmSGrp‘𝐺))
107		simpr 488	. . . 4 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → 𝑔 ∈ (Base‘𝐺))
108	1, 102, 3, 4, 5, 103, 106, 107	ghmqusnsglem1 19322	. . 3 ⊢ ((𝜑 ∧ 𝑔 ∈ (Base‘𝐺)) → (𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔))
109	108	ralrimiva 3156	. 2 ⊢ (𝜑 → ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔))
110	99, 109	jca 519	1 ⊢ (𝜑 → (𝐽 ∈ (𝑄 RingHom 𝐻) ∧ ∀𝑔 ∈ (Base‘𝐺)(𝐽‘[𝑔](𝐺 ~QG 𝑁)) = (𝐹‘𝑔)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1562   ∈ wcel 2144  {cab 2742  ∀wral 3078  ∃wrex 3088  Vcvv 3456   ⊆ wss 3906  {csn 4584  ∪ cuni 4867   class class class wbr 5102   ↦ cmpt 5183  ^◡ccnv 5648  dom cdm 5649   “ cima 5652  Fun wfun 6517  ⟶wf 6519  ‘cfv 6523  (class class class)co 7398  [cec 8678  Basecbs 17247  ._rcmulr 17289  0_gc0g 17470   /_s cqus 17537  NrmSGrpcnsg 19165   ~_QG cqg 19166   GrpHom cghm 19255  SRingcsrg 20238  Ringcrg 20285  CRingccrg 20286  ∥_rcdsr 20405   RingHom crh 20520  LIdealclidl 21278  RSpancrsp 21279

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-rep 5229  ax-sep 5248  ax-nul 5258  ax-pow 5324  ax-pr 5392  ax-un 7720  ax-cnex 11131  ax-resscn 11132  ax-1cn 11133  ax-icn 11134  ax-addcl 11135  ax-addrcl 11136  ax-mulcl 11137  ax-mulrcl 11138  ax-mulcom 11139  ax-addass 11140  ax-mulass 11141  ax-distr 11142  ax-i2m1 11143  ax-1ne0 11144  ax-1rid 11145  ax-rnegex 11146  ax-rrecex 11147  ax-cnre 11148  ax-pre-lttri 11149  ax-pre-lttrn 11150  ax-pre-ltadd 11151  ax-pre-mulgt0 11152

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3064  df-ral 3079  df-rex 3089  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3458  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5544  df-eprel 5549  df-po 5557  df-so 5558  df-fr 5602  df-we 5604  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-pred 6290  df-ord 6351  df-on 6352  df-lim 6353  df-suc 6354  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-riota 7355  df-ov 7401  df-oprab 7402  df-mpo 7403  df-om 7849  df-1st 7972  df-2nd 7973  df-tpos 8208  df-frecs 8264  df-wrecs 8295  df-recs 8344  df-rdg 8383  df-1o 8439  df-er 8680  df-ec 8682  df-qs 8686  df-map 8812  df-en 8930  df-dom 8931  df-sdom 8932  df-fin 8933  df-sup 9390  df-inf 9391  df-pnf 11220  df-mnf 11221  df-xr 11222  df-ltxr 11223  df-le 11224  df-sub 11418  df-neg 11419  df-nn 12213  df-2 12282  df-3 12283  df-4 12284  df-5 12285  df-6 12286  df-7 12287  df-8 12288  df-9 12289  df-n0 12484  df-z 12571  df-dec 12691  df-uz 12842  df-fz 13515  df-struct 17185  df-sets 17202  df-slot 17220  df-ndx 17232  df-base 17248  df-ress 17269  df-plusg 17301  df-mulr 17302  df-sca 17304  df-vsca 17305  df-ip 17306  df-tset 17307  df-ple 17308  df-ds 17310  df-0g 17472  df-imas 17540  df-qus 17541  df-mgm 18676  df-sgrp 18755  df-mnd 18771  df-mhm 18819  df-grp 18980  df-minusg 18981  df-sbg 18982  df-subg 19167  df-nsg 19168  df-eqg 19169  df-ghm 19256  df-cmn 19824  df-abl 19825  df-mgp 20189  df-rng 20201  df-ur 20234  df-srg 20239  df-ring 20287  df-cring 20288  df-oppr 20388  df-dvdsr 20408  df-rhm 20523  df-subrg 20622  df-lmod 20931  df-lss 21001  df-lsp 21041  df-sra 21242  df-rgmod 21243  df-lidl 21280  df-rsp 21281  df-2idl 21322

This theorem is referenced by:  aks5lem2  42809