rhmimaidl - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > rhmimaidl		Structured version Visualization version GIF version

Theorem rhmimaidl 31609

Description: The image of an ideal 𝐼 by a surjective ring homomorphism 𝐹 is an ideal. (Contributed by Thierry Arnoux, 6-Jul-2024.)

**Hypotheses**
Ref	Expression
rhmimaidl.b	⊢ 𝐵 = (Base‘𝑆)
rhmimaidl.t	⊢ 𝑇 = (LIdeal‘𝑅)
rhmimaidl.u	⊢ 𝑈 = (LIdeal‘𝑆)

**Assertion**
Ref	Expression
rhmimaidl	⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵 ∧ 𝐼 ∈ 𝑇) → (𝐹 “ 𝐼) ∈ 𝑈)

Proof of Theorem rhmimaidl Dummy variables 𝑎 𝑏 𝑖 𝑗 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2738	. . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅)
2		rhmimaidl.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑆)
3	1, 2	rhmf 19970	. . . . 5 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹:(Base‘𝑅)⟶𝐵)
4		fimass 6621	. . . . 5 ⊢ (𝐹:(Base‘𝑅)⟶𝐵 → (𝐹 “ 𝐼) ⊆ 𝐵)
5	3, 4	syl 17	. . . 4 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹 “ 𝐼) ⊆ 𝐵)
6	5	ad2antrr 723	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → (𝐹 “ 𝐼) ⊆ 𝐵)
7	3	ffnd 6601	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 Fn (Base‘𝑅))
8	7	ad2antrr 723	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → 𝐹 Fn (Base‘𝑅))
9		rhmrcl1 19963	. . . . . . 7 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑅 ∈ Ring)
10	9	ad2antrr 723	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → 𝑅 ∈ Ring)
11		eqid 2738	. . . . . . 7 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
12	1, 11	ring0cl 19808	. . . . . 6 ⊢ (𝑅 ∈ Ring → (0_g‘𝑅) ∈ (Base‘𝑅))
13	10, 12	syl 17	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → (0_g‘𝑅) ∈ (Base‘𝑅))
14		simpr 485	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → 𝐼 ∈ 𝑇)
15		rhmimaidl.t	. . . . . . 7 ⊢ 𝑇 = (LIdeal‘𝑅)
16	15, 11	lidl0cl 20483	. . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝐼 ∈ 𝑇) → (0_g‘𝑅) ∈ 𝐼)
17	10, 14, 16	syl2anc 584	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → (0_g‘𝑅) ∈ 𝐼)
18	8, 13, 17	fnfvimad 7110	. . . 4 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → (𝐹‘(0_g‘𝑅)) ∈ (𝐹 “ 𝐼))
19	18	ne0d 4269	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → (𝐹 “ 𝐼) ≠ ∅)
20		rhmghm 19969	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 ∈ (𝑅 GrpHom 𝑆))
21	20	ad4antr 729	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝐹 ∈ (𝑅 GrpHom 𝑆))
22	9	ad4antr 729	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝑅 ∈ Ring)
23		simpr 485	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝑧 ∈ (Base‘𝑅))
24	1, 15	lidlss 20481	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝐼 ∈ 𝑇 → 𝐼 ⊆ (Base‘𝑅))
25	24	ad4antlr 730	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝐼 ⊆ (Base‘𝑅))
26		simplr 766	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝑖 ∈ 𝐼)
27	25, 26	sseldd 3922	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝑖 ∈ (Base‘𝑅))
28		eqid 2738	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (._r‘𝑅) = (._r‘𝑅)
29	1, 28	ringcl 19800	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑅 ∈ Ring ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑖 ∈ (Base‘𝑅)) → (𝑧(._r‘𝑅)𝑖) ∈ (Base‘𝑅))
30	22, 23, 27, 29	syl3anc 1370	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝑧(._r‘𝑅)𝑖) ∈ (Base‘𝑅))
31		simpllr 773	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝑗 ∈ 𝐼)
32	25, 31	sseldd 3922	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝑗 ∈ (Base‘𝑅))
33		eqid 2738	. . . . . . . . . . . . . . . . . . . 20 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
34		eqid 2738	. . . . . . . . . . . . . . . . . . . 20 ⊢ (+_g‘𝑆) = (+_g‘𝑆)
35	1, 33, 34	ghmlin 18839	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ∈ (𝑅 GrpHom 𝑆) ∧ (𝑧(._r‘𝑅)𝑖) ∈ (Base‘𝑅) ∧ 𝑗 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = ((𝐹‘(𝑧(._r‘𝑅)𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
36	21, 30, 32, 35	syl3anc 1370	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = ((𝐹‘(𝑧(._r‘𝑅)𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
37		simp-4l 780	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → 𝐹 ∈ (𝑅 RingHom 𝑆))
38		eqid 2738	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (._r‘𝑆) = (._r‘𝑆)
39	1, 28, 38	rhmmul 19971	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑧 ∈ (Base‘𝑅) ∧ 𝑖 ∈ (Base‘𝑅)) → (𝐹‘(𝑧(._r‘𝑅)𝑖)) = ((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖)))
40	37, 23, 27, 39	syl3anc 1370	. . . . . . . . . . . . . . . . . . 19 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘(𝑧(._r‘𝑅)𝑖)) = ((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖)))
41	40	oveq1d 7290	. . . . . . . . . . . . . . . . . 18 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → ((𝐹‘(𝑧(._r‘𝑅)𝑖))(+_g‘𝑆)(𝐹‘𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
42	36, 41	eqtrd 2778	. . . . . . . . . . . . . . . . 17 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
43	42	adantl4r 752	. . . . . . . . . . . . . . . 16 ⊢ ((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
44	43	adantl3r 747	. . . . . . . . . . . . . . 15 ⊢ (((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
45	44	adantl3r 747	. . . . . . . . . . . . . 14 ⊢ ((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
46	45	adantl3r 747	. . . . . . . . . . . . 13 ⊢ (((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
47	46	adantllr 716	. . . . . . . . . . . 12 ⊢ ((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ 𝑧 ∈ (Base‘𝑅)) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
48	47	ad4ant13 748	. . . . . . . . . . 11 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)))
49		simpr 485	. . . . . . . . . . . . 13 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (𝐹‘𝑧) = 𝑥)
50		simpllr 773	. . . . . . . . . . . . 13 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (𝐹‘𝑖) = 𝑎)
51	49, 50	oveq12d 7293	. . . . . . . . . . . 12 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → ((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖)) = (𝑥(._r‘𝑆)𝑎))
52		simp-5r 783	. . . . . . . . . . . 12 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (𝐹‘𝑗) = 𝑏)
53	51, 52	oveq12d 7293	. . . . . . . . . . 11 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (((𝐹‘𝑧)(._r‘𝑆)(𝐹‘𝑖))(+_g‘𝑆)(𝐹‘𝑗)) = ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏))
54	48, 53	eqtrd 2778	. . . . . . . . . 10 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) = ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏))
55	8	ad9antr 739	. . . . . . . . . . 11 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → 𝐹 Fn (Base‘𝑅))
56	14, 24	syl 17	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → 𝐼 ⊆ (Base‘𝑅))
57	56	ad9antr 739	. . . . . . . . . . . 12 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → 𝐼 ⊆ (Base‘𝑅))
58	14	ad9antr 739	. . . . . . . . . . . . 13 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → 𝐼 ∈ 𝑇)
59		simplr 766	. . . . . . . . . . . . 13 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → 𝑧 ∈ (Base‘𝑅))
60		simp-4r 781	. . . . . . . . . . . . 13 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → 𝑖 ∈ 𝐼)
61		simp-6r 785	. . . . . . . . . . . . 13 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → 𝑗 ∈ 𝐼)
62	15, 1, 33, 28	islidl 20482	. . . . . . . . . . . . . . . . 17 ⊢ (𝐼 ∈ 𝑇 ↔ (𝐼 ⊆ (Base‘𝑅) ∧ 𝐼 ≠ ∅ ∧ ∀𝑧 ∈ (Base‘𝑅)∀𝑖 ∈ 𝐼 ∀𝑗 ∈ 𝐼 ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ 𝐼))
63	62	simp3bi 1146	. . . . . . . . . . . . . . . 16 ⊢ (𝐼 ∈ 𝑇 → ∀𝑧 ∈ (Base‘𝑅)∀𝑖 ∈ 𝐼 ∀𝑗 ∈ 𝐼 ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ 𝐼)
64	63	r19.21bi 3134	. . . . . . . . . . . . . . 15 ⊢ ((𝐼 ∈ 𝑇 ∧ 𝑧 ∈ (Base‘𝑅)) → ∀𝑖 ∈ 𝐼 ∀𝑗 ∈ 𝐼 ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ 𝐼)
65	64	r19.21bi 3134	. . . . . . . . . . . . . 14 ⊢ (((𝐼 ∈ 𝑇 ∧ 𝑧 ∈ (Base‘𝑅)) ∧ 𝑖 ∈ 𝐼) → ∀𝑗 ∈ 𝐼 ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ 𝐼)
66	65	r19.21bi 3134	. . . . . . . . . . . . 13 ⊢ ((((𝐼 ∈ 𝑇 ∧ 𝑧 ∈ (Base‘𝑅)) ∧ 𝑖 ∈ 𝐼) ∧ 𝑗 ∈ 𝐼) → ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ 𝐼)
67	58, 59, 60, 61, 66	syl1111anc 837	. . . . . . . . . . . 12 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ 𝐼)
68	57, 67	sseldd 3922	. . . . . . . . . . 11 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → ((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗) ∈ (Base‘𝑅))
69	55, 68, 67	fnfvimad 7110	. . . . . . . . . 10 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → (𝐹‘((𝑧(._r‘𝑅)𝑖)(+_g‘𝑅)𝑗)) ∈ (𝐹 “ 𝐼))
70	54, 69	eqeltrrd 2840	. . . . . . . . 9 ⊢ ((((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) ∧ 𝑧 ∈ (Base‘𝑅)) ∧ (𝐹‘𝑧) = 𝑥) → ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
71	3	ad2antrr 723	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → 𝐹:(Base‘𝑅)⟶𝐵)
72	71	ffund 6604	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → Fun 𝐹)
73	72	ad7antr 735	. . . . . . . . . 10 ⊢ ((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) → Fun 𝐹)
74	3	fdmd 6611	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → dom 𝐹 = (Base‘𝑅))
75	74	imaeq2d 5969	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹 “ dom 𝐹) = (𝐹 “ (Base‘𝑅)))
76		imadmrn 5979	. . . . . . . . . . . . . . . . 17 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹
77	75, 76	eqtr3di 2793	. . . . . . . . . . . . . . . 16 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹 “ (Base‘𝑅)) = ran 𝐹)
78	77	eqeq1d 2740	. . . . . . . . . . . . . . 15 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → ((𝐹 “ (Base‘𝑅)) = 𝐵 ↔ ran 𝐹 = 𝐵))
79	78	biimpar 478	. . . . . . . . . . . . . 14 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) → (𝐹 “ (Base‘𝑅)) = 𝐵)
80	79	eleq2d 2824	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) → (𝑥 ∈ (𝐹 “ (Base‘𝑅)) ↔ 𝑥 ∈ 𝐵))
81	80	biimpar 478	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝐹 “ (Base‘𝑅)))
82	81	adantlr 712	. . . . . . . . . . 11 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝐹 “ (Base‘𝑅)))
83	82	ad6antr 733	. . . . . . . . . 10 ⊢ ((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) → 𝑥 ∈ (𝐹 “ (Base‘𝑅)))
84		fvelima 6835	. . . . . . . . . 10 ⊢ ((Fun 𝐹 ∧ 𝑥 ∈ (𝐹 “ (Base‘𝑅))) → ∃𝑧 ∈ (Base‘𝑅)(𝐹‘𝑧) = 𝑥)
85	73, 83, 84	syl2anc 584	. . . . . . . . 9 ⊢ ((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) → ∃𝑧 ∈ (Base‘𝑅)(𝐹‘𝑧) = 𝑥)
86	70, 85	r19.29a 3218	. . . . . . . 8 ⊢ ((((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) ∧ 𝑖 ∈ 𝐼) ∧ (𝐹‘𝑖) = 𝑎) → ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
87	72	ad5antr 731	. . . . . . . . 9 ⊢ ((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) → Fun 𝐹)
88		simp-4r 781	. . . . . . . . 9 ⊢ ((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) → 𝑎 ∈ (𝐹 “ 𝐼))
89		fvelima 6835	. . . . . . . . 9 ⊢ ((Fun 𝐹 ∧ 𝑎 ∈ (𝐹 “ 𝐼)) → ∃𝑖 ∈ 𝐼 (𝐹‘𝑖) = 𝑎)
90	87, 88, 89	syl2anc 584	. . . . . . . 8 ⊢ ((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) → ∃𝑖 ∈ 𝐼 (𝐹‘𝑖) = 𝑎)
91	86, 90	r19.29a 3218	. . . . . . 7 ⊢ ((((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) ∧ 𝑗 ∈ 𝐼) ∧ (𝐹‘𝑗) = 𝑏) → ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
92	72	ad3antrrr 727	. . . . . . . 8 ⊢ ((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) → Fun 𝐹)
93		simpr 485	. . . . . . . 8 ⊢ ((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) → 𝑏 ∈ (𝐹 “ 𝐼))
94		fvelima 6835	. . . . . . . 8 ⊢ ((Fun 𝐹 ∧ 𝑏 ∈ (𝐹 “ 𝐼)) → ∃𝑗 ∈ 𝐼 (𝐹‘𝑗) = 𝑏)
95	92, 93, 94	syl2anc 584	. . . . . . 7 ⊢ ((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) → ∃𝑗 ∈ 𝐼 (𝐹‘𝑗) = 𝑏)
96	91, 95	r19.29a 3218	. . . . . 6 ⊢ ((((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ 𝑎 ∈ (𝐹 “ 𝐼)) ∧ 𝑏 ∈ (𝐹 “ 𝐼)) → ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
97	96	anasss 467	. . . . 5 ⊢ (((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) ∧ (𝑎 ∈ (𝐹 “ 𝐼) ∧ 𝑏 ∈ (𝐹 “ 𝐼))) → ((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
98	97	ralrimivva 3123	. . . 4 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) ∧ 𝑥 ∈ 𝐵) → ∀𝑎 ∈ (𝐹 “ 𝐼)∀𝑏 ∈ (𝐹 “ 𝐼)((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
99	98	ralrimiva 3103	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ (𝐹 “ 𝐼)∀𝑏 ∈ (𝐹 “ 𝐼)((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼))
100		rhmimaidl.u	. . . 4 ⊢ 𝑈 = (LIdeal‘𝑆)
101	100, 2, 34, 38	islidl 20482	. . 3 ⊢ ((𝐹 “ 𝐼) ∈ 𝑈 ↔ ((𝐹 “ 𝐼) ⊆ 𝐵 ∧ (𝐹 “ 𝐼) ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ (𝐹 “ 𝐼)∀𝑏 ∈ (𝐹 “ 𝐼)((𝑥(._r‘𝑆)𝑎)(+_g‘𝑆)𝑏) ∈ (𝐹 “ 𝐼)))
102	6, 19, 99, 101	syl3anbrc 1342	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵) ∧ 𝐼 ∈ 𝑇) → (𝐹 “ 𝐼) ∈ 𝑈)
103	102	3impa 1109	1 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = 𝐵 ∧ 𝐼 ∈ 𝑇) → (𝐹 “ 𝐼) ∈ 𝑈)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 ⊆ wss 3887 ∅c0 4256 dom cdm 5589 ran crn 5590 “ cima 5592 Fun wfun 6427 Fn wfn 6428 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 +_gcplusg 16962 ._rcmulr 16963 0_gc0g 17150 GrpHom cghm 18831 Ringcrg 19783 RingHom crh 19956 LIdealclidl 20432

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-1st 7831 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-map 8617 df-en 8734 df-dom 8735 df-sdom 8736 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-sca 16978 df-vsca 16979 df-ip 16980 df-0g 17152 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-mhm 18430 df-grp 18580 df-minusg 18581 df-sbg 18582 df-subg 18752 df-ghm 18832 df-mgp 19721 df-ur 19738 df-ring 19785 df-rnghom 19959 df-subrg 20022 df-lmod 20125 df-lss 20194 df-sra 20434 df-rgmod 20435 df-lidl 20436

This theorem is referenced by: rhmpreimacnlem 31834 rhmpreimacn 31835

W3C validator