Theorem rhmpreimacn 33884

Description: The function mapping a prime ideal to its preimage by a surjective ring homomorphism is continuous, when considering the Zariski topology. Corollary 1.2.3 of [EGA], p. 83. Notice that the direction of the continuous map 𝐺 is reverse: the original ring homomorphism 𝐹 goes from 𝑅 to 𝑆, but the continuous map 𝐺 goes from 𝐵 to 𝐴. This mapping is also called "induced map on prime spectra" or "pullback on primes". (Contributed by Thierry Arnoux, 8-Jul-2024.)

Hypotheses

Ref	Expression
rhmpreimacn.t	⊢ 𝑇 = (Spec‘𝑅)
rhmpreimacn.u	⊢ 𝑈 = (Spec‘𝑆)
rhmpreimacn.a	⊢ 𝐴 = (PrmIdeal‘𝑅)
rhmpreimacn.b	⊢ 𝐵 = (PrmIdeal‘𝑆)
rhmpreimacn.j	⊢ 𝐽 = (TopOpen‘𝑇)
rhmpreimacn.k	⊢ 𝐾 = (TopOpen‘𝑈)
rhmpreimacn.g	⊢ 𝐺 = (𝑖 ∈ 𝐵 ↦ (◡𝐹 “ 𝑖))
rhmpreimacn.r	⊢ (𝜑 → 𝑅 ∈ CRing)
rhmpreimacn.s	⊢ (𝜑 → 𝑆 ∈ CRing)
rhmpreimacn.f	⊢ (𝜑 → 𝐹 ∈ (𝑅 RingHom 𝑆))
rhmpreimacn.1	⊢ (𝜑 → ran 𝐹 = (Base‘𝑆))

Assertion

Ref	Expression
rhmpreimacn	⊢ (𝜑 → 𝐺 ∈ (𝐾 Cn 𝐽))

Distinct variable groups:   𝑅,𝑖   𝑖,𝐽   𝑆,𝑖   𝜑,𝑖   𝑖,𝐺   𝐵,𝑖   𝐴,𝑖   𝑖,𝐹

Allowed substitution hints:   𝑇(𝑖)   𝑈(𝑖)   𝐾(𝑖)

Proof of Theorem rhmpreimacn

Dummy variables 𝑎 𝑏 𝑘 𝑙 𝑗 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rhmpreimacn.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ CRing)
2		rhmpreimacn.u	. . . 4 ⊢ 𝑈 = (Spec‘𝑆)
3		rhmpreimacn.k	. . . 4 ⊢ 𝐾 = (TopOpen‘𝑈)
4		rhmpreimacn.b	. . . 4 ⊢ 𝐵 = (PrmIdeal‘𝑆)
5	2, 3, 4	zartopon 33876	. . 3 ⊢ (𝑆 ∈ CRing → 𝐾 ∈ (TopOn‘𝐵))
6	1, 5	syl 17	. 2 ⊢ (𝜑 → 𝐾 ∈ (TopOn‘𝐵))
7		rhmpreimacn.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ CRing)
8		rhmpreimacn.t	. . . 4 ⊢ 𝑇 = (Spec‘𝑅)
9		rhmpreimacn.j	. . . 4 ⊢ 𝐽 = (TopOpen‘𝑇)
10		rhmpreimacn.a	. . . 4 ⊢ 𝐴 = (PrmIdeal‘𝑅)
11	8, 9, 10	zartopon 33876	. . 3 ⊢ (𝑅 ∈ CRing → 𝐽 ∈ (TopOn‘𝐴))
12	7, 11	syl 17	. 2 ⊢ (𝜑 → 𝐽 ∈ (TopOn‘𝐴))
13	1	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐵) → 𝑆 ∈ CRing)
14		rhmpreimacn.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (𝑅 RingHom 𝑆))
15	14	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐵) → 𝐹 ∈ (𝑅 RingHom 𝑆))
16		simpr 484	. . . . 5 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐵) → 𝑖 ∈ 𝐵)
17	16, 4	eleqtrdi 2851	. . . 4 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐵) → 𝑖 ∈ (PrmIdeal‘𝑆))
18	10	rhmpreimaprmidl 33479	. . . 4 ⊢ (((𝑆 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ 𝑖 ∈ (PrmIdeal‘𝑆)) → (◡𝐹 “ 𝑖) ∈ 𝐴)
19	13, 15, 17, 18	syl21anc 838	. . 3 ⊢ ((𝜑 ∧ 𝑖 ∈ 𝐵) → (◡𝐹 “ 𝑖) ∈ 𝐴)
20		rhmpreimacn.g	. . 3 ⊢ 𝐺 = (𝑖 ∈ 𝐵 ↦ (◡𝐹 “ 𝑖))
21	19, 20	fmptd 7134	. 2 ⊢ (𝜑 → 𝐺:𝐵⟶𝐴)
22	4	fvexi 6920	. . . . . . 7 ⊢ 𝐵 ∈ V
23	22	rabex 5339	. . . . . 6 ⊢ {𝑘 ∈ 𝐵 ∣ 𝑗 ⊆ 𝑘} ∈ V
24		sseq1 4009	. . . . . . . 8 ⊢ (𝑙 = 𝑗 → (𝑙 ⊆ 𝑘 ↔ 𝑗 ⊆ 𝑘))
25	24	rabbidv 3444	. . . . . . 7 ⊢ (𝑙 = 𝑗 → {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘} = {𝑘 ∈ 𝐵 ∣ 𝑗 ⊆ 𝑘})
26	25	cbvmptv 5255	. . . . . 6 ⊢ (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) = (𝑗 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑗 ⊆ 𝑘})
27	23, 26	fnmpti 6711	. . . . 5 ⊢ (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) Fn (LIdeal‘𝑆)
28	14	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → 𝐹 ∈ (𝑅 RingHom 𝑆))
29		rhmpreimacn.1	. . . . . . . . 9 ⊢ (𝜑 → ran 𝐹 = (Base‘𝑆))
30	29	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → ran 𝐹 = (Base‘𝑆))
31		simplr 769	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → 𝑎 ∈ (LIdeal‘𝑅))
32		eqid 2737	. . . . . . . . 9 ⊢ (Base‘𝑆) = (Base‘𝑆)
33		eqid 2737	. . . . . . . . 9 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
34		eqid 2737	. . . . . . . . 9 ⊢ (LIdeal‘𝑆) = (LIdeal‘𝑆)
35	32, 33, 34	rhmimaidl 33460	. . . . . . . 8 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ ran 𝐹 = (Base‘𝑆) ∧ 𝑎 ∈ (LIdeal‘𝑅)) → (𝐹 “ 𝑎) ∈ (LIdeal‘𝑆))
36	28, 30, 31, 35	syl3anc 1373	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → (𝐹 “ 𝑎) ∈ (LIdeal‘𝑆))
37		fveqeq2 6915	. . . . . . . 8 ⊢ (𝑏 = (𝐹 “ 𝑎) → (((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘𝑏) = (◡𝐺 “ 𝑥) ↔ ((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘(𝐹 “ 𝑎)) = (◡𝐺 “ 𝑥)))
38	37	adantl 481	. . . . . . 7 ⊢ (((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) ∧ 𝑏 = (𝐹 “ 𝑎)) → (((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘𝑏) = (◡𝐺 “ 𝑥) ↔ ((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘(𝐹 “ 𝑎)) = (◡𝐺 “ 𝑥)))
39	7	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → 𝑅 ∈ CRing)
40	1	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → 𝑆 ∈ CRing)
41	24	rabbidv 3444	. . . . . . . . . 10 ⊢ (𝑙 = 𝑗 → {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘} = {𝑘 ∈ 𝐴 ∣ 𝑗 ⊆ 𝑘})
42	41	cbvmptv 5255	. . . . . . . . 9 ⊢ (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) = (𝑗 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑗 ⊆ 𝑘})
43	8, 2, 10, 4, 9, 3, 20, 39, 40, 28, 30, 31, 42, 26	rhmpreimacnlem 33883	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → ((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘(𝐹 “ 𝑎)) = (◡𝐺 “ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎)))
44		simpr 484	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥)
45	44	imaeq2d 6078	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → (◡𝐺 “ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎)) = (◡𝐺 “ 𝑥))
46	43, 45	eqtrd 2777	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → ((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘(𝐹 “ 𝑎)) = (◡𝐺 “ 𝑥))
47	36, 38, 46	rspcedvd 3624	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) ∧ 𝑎 ∈ (LIdeal‘𝑅)) ∧ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥) → ∃𝑏 ∈ (LIdeal‘𝑆)((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘𝑏) = (◡𝐺 “ 𝑥))
48	10	fvexi 6920	. . . . . . . . 9 ⊢ 𝐴 ∈ V
49	48	rabex 5339	. . . . . . . 8 ⊢ {𝑘 ∈ 𝐴 ∣ 𝑗 ⊆ 𝑘} ∈ V
50	49, 42	fnmpti 6711	. . . . . . 7 ⊢ (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) Fn (LIdeal‘𝑅)
51		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑥 ∈ (Clsd‘𝐽))
52	7	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑅 ∈ CRing)
53	8, 9, 10, 42	zartopn 33874	. . . . . . . . . 10 ⊢ (𝑅 ∈ CRing → (𝐽 ∈ (TopOn‘𝐴) ∧ ran (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐽)))
54	53	simprd 495	. . . . . . . . 9 ⊢ (𝑅 ∈ CRing → ran (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐽))
55	52, 54	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → ran (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐽))
56	51, 55	eleqtrrd 2844	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → 𝑥 ∈ ran (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}))
57		fvelrnb 6969	. . . . . . . 8 ⊢ ((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) Fn (LIdeal‘𝑅) → (𝑥 ∈ ran (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) ↔ ∃𝑎 ∈ (LIdeal‘𝑅)((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥))
58	57	biimpa 476	. . . . . . 7 ⊢ (((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘}) Fn (LIdeal‘𝑅) ∧ 𝑥 ∈ ran (𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})) → ∃𝑎 ∈ (LIdeal‘𝑅)((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥)
59	50, 56, 58	sylancr 587	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → ∃𝑎 ∈ (LIdeal‘𝑅)((𝑙 ∈ (LIdeal‘𝑅) ↦ {𝑘 ∈ 𝐴 ∣ 𝑙 ⊆ 𝑘})‘𝑎) = 𝑥)
60	47, 59	r19.29a 3162	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → ∃𝑏 ∈ (LIdeal‘𝑆)((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘𝑏) = (◡𝐺 “ 𝑥))
61		fvelrnb 6969	. . . . . 6 ⊢ ((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) Fn (LIdeal‘𝑆) → ((◡𝐺 “ 𝑥) ∈ ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) ↔ ∃𝑏 ∈ (LIdeal‘𝑆)((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘𝑏) = (◡𝐺 “ 𝑥)))
62	61	biimpar 477	. . . . 5 ⊢ (((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) Fn (LIdeal‘𝑆) ∧ ∃𝑏 ∈ (LIdeal‘𝑆)((𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘})‘𝑏) = (◡𝐺 “ 𝑥)) → (◡𝐺 “ 𝑥) ∈ ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}))
63	27, 60, 62	sylancr 587	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (◡𝐺 “ 𝑥) ∈ ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}))
64	2, 3, 4, 26	zartopn 33874	. . . . . . 7 ⊢ (𝑆 ∈ CRing → (𝐾 ∈ (TopOn‘𝐵) ∧ ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐾)))
65	64	simprd 495	. . . . . 6 ⊢ (𝑆 ∈ CRing → ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐾))
66	1, 65	syl 17	. . . . 5 ⊢ (𝜑 → ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐾))
67	66	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → ran (𝑙 ∈ (LIdeal‘𝑆) ↦ {𝑘 ∈ 𝐵 ∣ 𝑙 ⊆ 𝑘}) = (Clsd‘𝐾))
68	63, 67	eleqtrd 2843	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (Clsd‘𝐽)) → (◡𝐺 “ 𝑥) ∈ (Clsd‘𝐾))
69	68	ralrimiva 3146	. 2 ⊢ (𝜑 → ∀𝑥 ∈ (Clsd‘𝐽)(◡𝐺 “ 𝑥) ∈ (Clsd‘𝐾))
70		iscncl 23277	. . 3 ⊢ ((𝐾 ∈ (TopOn‘𝐵) ∧ 𝐽 ∈ (TopOn‘𝐴)) → (𝐺 ∈ (𝐾 Cn 𝐽) ↔ (𝐺:𝐵⟶𝐴 ∧ ∀𝑥 ∈ (Clsd‘𝐽)(◡𝐺 “ 𝑥) ∈ (Clsd‘𝐾))))
71	70	biimpar 477	. 2 ⊢ (((𝐾 ∈ (TopOn‘𝐵) ∧ 𝐽 ∈ (TopOn‘𝐴)) ∧ (𝐺:𝐵⟶𝐴 ∧ ∀𝑥 ∈ (Clsd‘𝐽)(◡𝐺 “ 𝑥) ∈ (Clsd‘𝐾))) → 𝐺 ∈ (𝐾 Cn 𝐽))
72	6, 12, 21, 69, 71	syl22anc 839	1 ⊢ (𝜑 → 𝐺 ∈ (𝐾 Cn 𝐽))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2108  ∀wral 3061  ∃wrex 3070  {crab 3436   ⊆ wss 3951   ↦ cmpt 5225  ^◡ccnv 5684  ran crn 5686   “ cima 5688   Fn wfn 6556  ⟶wf 6557  ‘cfv 6561  (class class class)co 7431  Basecbs 17247  TopOpenctopn 17466  CRingccrg 20231   RingHom crh 20469  LIdealclidl 21216  TopOnctopon 22916  Clsdccld 23024   Cn ccn 23232  PrmIdealcprmidl 33463  Speccrspec 33861

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-ac2 10503  ax-cnex 11211  ax-resscn 11212  ax-1cn 11213  ax-icn 11214  ax-addcl 11215  ax-addrcl 11216  ax-mulcl 11217  ax-mulrcl 11218  ax-mulcom 11219  ax-addass 11220  ax-mulass 11221  ax-distr 11222  ax-i2m1 11223  ax-1ne0 11224  ax-1rid 11225  ax-rnegex 11226  ax-rrecex 11227  ax-cnre 11228  ax-pre-lttri 11229  ax-pre-lttrn 11230  ax-pre-ltadd 11231  ax-pre-mulgt0 11232

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-tp 4631  df-op 4633  df-uni 4908  df-int 4947  df-iun 4993  df-iin 4994  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-se 5638  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-isom 6570  df-riota 7388  df-ov 7434  df-oprab 7435  df-mpo 7436  df-rpss 7743  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-1o 8506  df-oadd 8510  df-er 8745  df-map 8868  df-en 8986  df-dom 8987  df-sdom 8988  df-fin 8989  df-dju 9941  df-card 9979  df-ac 10156  df-pnf 11297  df-mnf 11298  df-xr 11299  df-ltxr 11300  df-le 11301  df-sub 11494  df-neg 11495  df-nn 12267  df-2 12329  df-3 12330  df-4 12331  df-5 12332  df-6 12333  df-7 12334  df-8 12335  df-9 12336  df-n0 12527  df-z 12614  df-dec 12734  df-uz 12879  df-fz 13548  df-struct 17184  df-sets 17201  df-slot 17219  df-ndx 17231  df-base 17248  df-ress 17275  df-plusg 17310  df-mulr 17311  df-sca 17313  df-vsca 17314  df-ip 17315  df-tset 17316  df-ple 17317  df-rest 17467  df-topn 17468  df-0g 17486  df-mre 17629  df-mgm 18653  df-sgrp 18732  df-mnd 18748  df-mhm 18796  df-submnd 18797  df-grp 18954  df-minusg 18955  df-sbg 18956  df-subg 19141  df-ghm 19231  df-cntz 19335  df-lsm 19654  df-cmn 19800  df-abl 19801  df-mgp 20138  df-rng 20150  df-ur 20179  df-ring 20232  df-cring 20233  df-rhm 20472  df-subrg 20570  df-lmod 20860  df-lss 20930  df-lsp 20970  df-sra 21172  df-rgmod 21173  df-lidl 21218  df-rsp 21219  df-lpidl 21332  df-top 22900  df-topon 22917  df-cld 23027  df-cn 23235  df-prmidl 33464  df-mxidl 33488  df-idlsrg 33529  df-rspec 33862

This theorem is referenced by: (None)