Theorem rhmpreimaprmidl 21686

Description: The preimage of a prime ideal by a ring homomorphism is a prime ideal. (Contributed by Thierry Arnoux, 29-Jun-2024.)

Hypothesis

Ref	Expression
rhmpreimaprmidl.p	⊢ 𝑃 = (PrmIdeal‘𝑅)

Assertion

Ref	Expression
rhmpreimaprmidl	⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ∈ 𝑃)

Proof of Theorem rhmpreimaprmidl

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rhmrcl1 20758	. . . 4 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑅 ∈ Ring)
2	1	ad2antlr 740	. . 3 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → 𝑅 ∈ Ring)
3		rhmrcl2 20759	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑆 ∈ Ring)
4		prmidlidl 21676	. . . . . 6 ⊢ ((𝑆 ∈ Ring ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → 𝐽 ∈ (LIdeal‘𝑆))
5	3, 4	sylan 592	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → 𝐽 ∈ (LIdeal‘𝑆))
6		eqid 2763	. . . . . 6 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
7	6	rhmpreimaidl 21622	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (LIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ∈ (LIdeal‘𝑅))
8	5, 7	syldan 603	. . . 4 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ∈ (LIdeal‘𝑅))
9	8	adantll 727	. . 3 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ∈ (LIdeal‘𝑅))
10	3	adantr 486	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → 𝑆 ∈ Ring)
11		eqid 2763	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
12		eqid 2763	. . . . . . . . 9 ⊢ (.r‘𝑆) = (.r‘𝑆)
13	11, 12	prmidlnr 21671	. . . . . . . 8 ⊢ ((𝑆 ∈ Ring ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → 𝐽 ≠ (Base‘𝑆))
14	3, 13	sylan 592	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → 𝐽 ≠ (Base‘𝑆))
15		eqid 2763	. . . . . . . 8 ⊢ (1r‘𝑆) = (1r‘𝑆)
16	11, 15	pridln1 21675	. . . . . . 7 ⊢ ((𝑆 ∈ Ring ∧ 𝐽 ∈ (LIdeal‘𝑆) ∧ 𝐽 ≠ (Base‘𝑆)) → ¬ (1r‘𝑆) ∈ 𝐽)
17	10, 5, 14, 16	syl3anc 1399	. . . . . 6 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → ¬ (1r‘𝑆) ∈ 𝐽)
18		eqid 2763	. . . . . . . . 9 ⊢ (1r‘𝑅) = (1r‘𝑅)
19	18, 15	rhm1 20775	. . . . . . . 8 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝐹‘(1r‘𝑅)) = (1r‘𝑆))
20	19	ad2antrr 739	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → (𝐹‘(1r‘𝑅)) = (1r‘𝑆))
21		eqid 2763	. . . . . . . . . . . 12 ⊢ (Base‘𝑅) = (Base‘𝑅)
22	21, 11	rhmf 20766	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹:(Base‘𝑅)⟶(Base‘𝑆))
23	22	ffnd 6740	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹 Fn (Base‘𝑅))
24	23	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → 𝐹 Fn (Base‘𝑅))
25	21, 18	ringidcl 20545	. . . . . . . . . . . 12 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ (Base‘𝑅))
26	1, 25	syl 18	. . . . . . . . . . 11 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → (1r‘𝑅) ∈ (Base‘𝑅))
27	26	ad2antrr 739	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → (1r‘𝑅) ∈ (Base‘𝑅))
28		simpr 490	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → (◡𝐹 “ 𝐽) = (Base‘𝑅))
29	27, 28	eleqtrrd 2867	. . . . . . . . 9 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → (1r‘𝑅) ∈ (◡𝐹 “ 𝐽))
30		elpreima 7088	. . . . . . . . . 10 ⊢ (𝐹 Fn (Base‘𝑅) → ((1r‘𝑅) ∈ (◡𝐹 “ 𝐽) ↔ ((1r‘𝑅) ∈ (Base‘𝑅) ∧ (𝐹‘(1r‘𝑅)) ∈ 𝐽)))
31	30	biimpa 482	. . . . . . . . 9 ⊢ ((𝐹 Fn (Base‘𝑅) ∧ (1r‘𝑅) ∈ (◡𝐹 “ 𝐽)) → ((1r‘𝑅) ∈ (Base‘𝑅) ∧ (𝐹‘(1r‘𝑅)) ∈ 𝐽))
32	24, 29, 31	syl2anc 596	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → ((1r‘𝑅) ∈ (Base‘𝑅) ∧ (𝐹‘(1r‘𝑅)) ∈ 𝐽))
33	32	simprd 501	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → (𝐹‘(1r‘𝑅)) ∈ 𝐽)
34	20, 33	eqeltrrd 2865	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (◡𝐹 “ 𝐽) = (Base‘𝑅)) → (1r‘𝑆) ∈ 𝐽)
35	17, 34	mtand 828	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → ¬ (◡𝐹 “ 𝐽) = (Base‘𝑅))
36	35	neqned 2966	. . . 4 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ≠ (Base‘𝑅))
37	36	adantll 727	. . 3 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ≠ (Base‘𝑅))
38		simp-5l 797	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝑆 ∈ CRing)
39		simp-4r 796	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝐽 ∈ (PrmIdeal‘𝑆))
40		simp-5r 798	. . . . . . . . . 10 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝐹 ∈ (𝑅 RingHom 𝑆))
41	40, 22	syl 18	. . . . . . . . 9 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝐹:(Base‘𝑅)⟶(Base‘𝑆))
42		simpllr 788	. . . . . . . . 9 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝑎 ∈ (Base‘𝑅))
43	41, 42	ffvelcdmd 7117	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝐹‘𝑎) ∈ (Base‘𝑆))
44		simplr 781	. . . . . . . . 9 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝑏 ∈ (Base‘𝑅))
45	41, 44	ffvelcdmd 7117	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝐹‘𝑏) ∈ (Base‘𝑆))
46		eqid 2763	. . . . . . . . . . 11 ⊢ (.r‘𝑅) = (.r‘𝑅)
47	21, 46, 12	rhmmul 20771	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) = ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)))
48	40, 42, 44, 47	syl3anc 1399	. . . . . . . . 9 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) = ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)))
49	23	ad5antlr 748	. . . . . . . . . 10 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → 𝐹 Fn (Base‘𝑅))
50		simpr 490	. . . . . . . . . 10 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽))
51		elpreima 7088	. . . . . . . . . . 11 ⊢ (𝐹 Fn (Base‘𝑅) → ((𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽) ↔ ((𝑎(.r‘𝑅)𝑏) ∈ (Base‘𝑅) ∧ (𝐹‘(𝑎(.r‘𝑅)𝑏)) ∈ 𝐽)))
52	51	simplbda 505	. . . . . . . . . 10 ⊢ ((𝐹 Fn (Base‘𝑅) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) ∈ 𝐽)
53	49, 50, 52	syl2anc 596	. . . . . . . . 9 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) ∈ 𝐽)
54	48, 53	eqeltrrd 2865	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)) ∈ 𝐽)
55	11, 12	prmidlc 21680	. . . . . . . 8 ⊢ (((𝑆 ∈ CRing ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ ((𝐹‘𝑎) ∈ (Base‘𝑆) ∧ (𝐹‘𝑏) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)) ∈ 𝐽)) → ((𝐹‘𝑎) ∈ 𝐽 ∨ (𝐹‘𝑏) ∈ 𝐽))
56	38, 39, 43, 45, 54, 55	syl23anc 1405	. . . . . . 7 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → ((𝐹‘𝑎) ∈ 𝐽 ∨ (𝐹‘𝑏) ∈ 𝐽))
57	49	adantr 486	. . . . . . . . . 10 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑎) ∈ 𝐽) → 𝐹 Fn (Base‘𝑅))
58	42	adantr 486	. . . . . . . . . 10 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑎) ∈ 𝐽) → 𝑎 ∈ (Base‘𝑅))
59		simpr 490	. . . . . . . . . 10 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑎) ∈ 𝐽) → (𝐹‘𝑎) ∈ 𝐽)
60	57, 58, 59	elpreimad 7090	. . . . . . . . 9 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑎) ∈ 𝐽) → 𝑎 ∈ (◡𝐹 “ 𝐽))
61	60	ex 418	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → ((𝐹‘𝑎) ∈ 𝐽 → 𝑎 ∈ (◡𝐹 “ 𝐽)))
62	49	adantr 486	. . . . . . . . . 10 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑏) ∈ 𝐽) → 𝐹 Fn (Base‘𝑅))
63		simpllr 788	. . . . . . . . . 10 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑏) ∈ 𝐽) → 𝑏 ∈ (Base‘𝑅))
64		simpr 490	. . . . . . . . . 10 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑏) ∈ 𝐽) → (𝐹‘𝑏) ∈ 𝐽)
65	62, 63, 64	elpreimad 7090	. . . . . . . . 9 ⊢ (((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) ∧ (𝐹‘𝑏) ∈ 𝐽) → 𝑏 ∈ (◡𝐹 “ 𝐽))
66	65	ex 418	. . . . . . . 8 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → ((𝐹‘𝑏) ∈ 𝐽 → 𝑏 ∈ (◡𝐹 “ 𝐽)))
67	61, 66	orim12d 979	. . . . . . 7 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (((𝐹‘𝑎) ∈ 𝐽 ∨ (𝐹‘𝑏) ∈ 𝐽) → (𝑎 ∈ (◡𝐹 “ 𝐽) ∨ 𝑏 ∈ (◡𝐹 “ 𝐽))))
68	56, 67	mpd 16	. . . . . 6 ⊢ ((((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) ∧ (𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽)) → (𝑎 ∈ (◡𝐹 “ 𝐽) ∨ 𝑏 ∈ (◡𝐹 “ 𝐽)))
69	68	ex 418	. . . . 5 ⊢ (((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ 𝑎 ∈ (Base‘𝑅)) ∧ 𝑏 ∈ (Base‘𝑅)) → ((𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽) → (𝑎 ∈ (◡𝐹 “ 𝐽) ∨ 𝑏 ∈ (◡𝐹 “ 𝐽))))
70	69	anasss 472	. . . 4 ⊢ ((((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) ∧ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅))) → ((𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽) → (𝑎 ∈ (◡𝐹 “ 𝐽) ∨ 𝑏 ∈ (◡𝐹 “ 𝐽))))
71	70	ralrimivva 3209	. . 3 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → ∀𝑎 ∈ (Base‘𝑅)∀𝑏 ∈ (Base‘𝑅)((𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽) → (𝑎 ∈ (◡𝐹 “ 𝐽) ∨ 𝑏 ∈ (◡𝐹 “ 𝐽))))
72	21, 46	prmidl2 21673	. . 3 ⊢ (((𝑅 ∈ Ring ∧ (◡𝐹 “ 𝐽) ∈ (LIdeal‘𝑅)) ∧ ((◡𝐹 “ 𝐽) ≠ (Base‘𝑅) ∧ ∀𝑎 ∈ (Base‘𝑅)∀𝑏 ∈ (Base‘𝑅)((𝑎(.r‘𝑅)𝑏) ∈ (◡𝐹 “ 𝐽) → (𝑎 ∈ (◡𝐹 “ 𝐽) ∨ 𝑏 ∈ (◡𝐹 “ 𝐽))))) → (◡𝐹 “ 𝐽) ∈ (PrmIdeal‘𝑅))
73	2, 9, 37, 71, 72	syl22anc 852	. 2 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ∈ (PrmIdeal‘𝑅))
74		rhmpreimaprmidl.p	. 2 ⊢ 𝑃 = (PrmIdeal‘𝑅)
75	73, 74	eleqtrrdi 2875	1 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝐽 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝐽) ∈ 𝑃)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ^◡ccnv 5657   “ cima 5661   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  ._rcmulr 17473  1_rcur 20458  Ringcrg 20510  CRingccrg 20511   RingHom crh 20750  LIdealclidl 21535  PrmIdealcprmidl 21667

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-3 12446  df-4 12447  df-5 12448  df-6 12449  df-7 12450  df-8 12451  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-mulr 17487  df-sca 17489  df-vsca 17490  df-ip 17491  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-mhm 19028  df-grp 19197  df-minusg 19198  df-sbg 19199  df-subg 19383  df-ghm 19478  df-cmn 20047  df-abl 20048  df-mgp 20412  df-rng 20426  df-ur 20459  df-ring 20512  df-cring 20513  df-rhm 20753  df-subrg 20873  df-lmod 21188  df-lss 21258  df-lsp 21298  df-sra 21499  df-rgmod 21500  df-lidl 21537  df-rsp 21538  df-prmidl 21668

This theorem is used by:  ply1annprmidl  34450  rhmpreimacnlem  34627  rhmpreimacn  34628