isprmidlc - Mathbox for Thierry Arnoux

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

Theorem isprmidlc 32524

Description: The predicate "is prime ideal" for commutative rings. Alternate definition for commutative rings. See definition in [Lang] p. 92. (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Thierry Arnoux, 12-Jan-2024.)

**Hypotheses**
Ref	Expression
isprmidlc.1	⊢ 𝐵 = (Base‘𝑅)
isprmidlc.2	⊢ · = (._r‘𝑅)

**Assertion**
Ref	Expression
isprmidlc	⊢ (𝑅 ∈ CRing → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))))

Distinct variable groups: 𝑥,𝐵,𝑦 𝑥,𝑃,𝑦 𝑥,𝑅,𝑦 Allowed substitution hints: · (𝑥,𝑦)

Proof of Theorem isprmidlc Dummy variables 𝑚 𝑛 𝑟 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		crngring 20059	. . . 4 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring)
2		prmidlidl 32520	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → 𝑃 ∈ (LIdeal‘𝑅))
3	1, 2	sylan 581	. . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → 𝑃 ∈ (LIdeal‘𝑅))
4		isprmidlc.1	. . . . 5 ⊢ 𝐵 = (Base‘𝑅)
5		isprmidlc.2	. . . . 5 ⊢ · = (._r‘𝑅)
6	4, 5	prmidlnr 32515	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → 𝑃 ≠ 𝐵)
7	1, 6	sylan 581	. . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → 𝑃 ≠ 𝐵)
8	1	ad4antr 731	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → 𝑅 ∈ Ring)
9		simp-4r 783	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → 𝑃 ∈ (PrmIdeal‘𝑅))
10		simpllr 775	. . . . . . . . . . 11 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → 𝑥 ∈ 𝐵)
11	10	snssd 4811	. . . . . . . . . 10 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → {𝑥} ⊆ 𝐵)
12		eqid 2733	. . . . . . . . . . 11 ⊢ (RSpan‘𝑅) = (RSpan‘𝑅)
13		eqid 2733	. . . . . . . . . . 11 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
14	12, 4, 13	rspcl 20834	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ {𝑥} ⊆ 𝐵) → ((RSpan‘𝑅)‘{𝑥}) ∈ (LIdeal‘𝑅))
15	8, 11, 14	syl2anc 585	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → ((RSpan‘𝑅)‘{𝑥}) ∈ (LIdeal‘𝑅))
16		simplr 768	. . . . . . . . . . 11 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → 𝑦 ∈ 𝐵)
17	16	snssd 4811	. . . . . . . . . 10 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → {𝑦} ⊆ 𝐵)
18	12, 4, 13	rspcl 20834	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ {𝑦} ⊆ 𝐵) → ((RSpan‘𝑅)‘{𝑦}) ∈ (LIdeal‘𝑅))
19	8, 17, 18	syl2anc 585	. . . . . . . . 9 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → ((RSpan‘𝑅)‘{𝑦}) ∈ (LIdeal‘𝑅))
20	15, 19	jca 513	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → (((RSpan‘𝑅)‘{𝑥}) ∈ (LIdeal‘𝑅) ∧ ((RSpan‘𝑅)‘{𝑦}) ∈ (LIdeal‘𝑅)))
21		simpllr 775	. . . . . . . . . . . . . 14 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑟 = (𝑚 · 𝑥))
22		simpr 486	. . . . . . . . . . . . . 14 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑠 = (𝑛 · 𝑦))
23	21, 22	oveq12d 7422	. . . . . . . . . . . . 13 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → (𝑟 · 𝑠) = ((𝑚 · 𝑥) · (𝑛 · 𝑦)))
24		simp-10l 794	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑅 ∈ CRing)
25		simp-4r 783	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑚 ∈ 𝐵)
26	10	ad2antrr 725	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) → 𝑥 ∈ 𝐵)
27	26	ad4antr 731	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑥 ∈ 𝐵)
28		simplr 768	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑛 ∈ 𝐵)
29	16	ad4antr 731	. . . . . . . . . . . . . . . 16 ⊢ (((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) → 𝑦 ∈ 𝐵)
30	29	ad2antrr 725	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑦 ∈ 𝐵)
31	4, 5	cringm4 32523	. . . . . . . . . . . . . . 15 ⊢ ((𝑅 ∈ CRing ∧ (𝑚 ∈ 𝐵 ∧ 𝑥 ∈ 𝐵) ∧ (𝑛 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑚 · 𝑥) · (𝑛 · 𝑦)) = ((𝑚 · 𝑛) · (𝑥 · 𝑦)))
32	24, 25, 27, 28, 30, 31	syl122anc 1380	. . . . . . . . . . . . . 14 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → ((𝑚 · 𝑥) · (𝑛 · 𝑦)) = ((𝑚 · 𝑛) · (𝑥 · 𝑦)))
33	24, 1	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑅 ∈ Ring)
34	3	ad9antr 741	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → 𝑃 ∈ (LIdeal‘𝑅))
35	4, 5	ringcl 20064	. . . . . . . . . . . . . . . 16 ⊢ ((𝑅 ∈ Ring ∧ 𝑚 ∈ 𝐵 ∧ 𝑛 ∈ 𝐵) → (𝑚 · 𝑛) ∈ 𝐵)
36	33, 25, 28, 35	syl3anc 1372	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → (𝑚 · 𝑛) ∈ 𝐵)
37		simp-7r 789	. . . . . . . . . . . . . . 15 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → (𝑥 · 𝑦) ∈ 𝑃)
38	13, 4, 5	lidlmcl 20827	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ Ring ∧ 𝑃 ∈ (LIdeal‘𝑅)) ∧ ((𝑚 · 𝑛) ∈ 𝐵 ∧ (𝑥 · 𝑦) ∈ 𝑃)) → ((𝑚 · 𝑛) · (𝑥 · 𝑦)) ∈ 𝑃)
39	33, 34, 36, 37, 38	syl22anc 838	. . . . . . . . . . . . . 14 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → ((𝑚 · 𝑛) · (𝑥 · 𝑦)) ∈ 𝑃)
40	32, 39	eqeltrd 2834	. . . . . . . . . . . . 13 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → ((𝑚 · 𝑥) · (𝑛 · 𝑦)) ∈ 𝑃)
41	23, 40	eqeltrd 2834	. . . . . . . . . . . 12 ⊢ (((((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) ∧ 𝑛 ∈ 𝐵) ∧ 𝑠 = (𝑛 · 𝑦)) → (𝑟 · 𝑠) ∈ 𝑃)
42	8	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ (((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) → 𝑅 ∈ Ring)
43	42	ad2antrr 725	. . . . . . . . . . . . 13 ⊢ (((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) → 𝑅 ∈ Ring)
44		simpllr 775	. . . . . . . . . . . . 13 ⊢ (((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) → 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦}))
45	4, 5, 12	rspsnel 32453	. . . . . . . . . . . . . 14 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) → (𝑠 ∈ ((RSpan‘𝑅)‘{𝑦}) ↔ ∃𝑛 ∈ 𝐵 𝑠 = (𝑛 · 𝑦)))
46	45	biimpa 478	. . . . . . . . . . . . 13 ⊢ (((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) → ∃𝑛 ∈ 𝐵 𝑠 = (𝑛 · 𝑦))
47	43, 29, 44, 46	syl21anc 837	. . . . . . . . . . . 12 ⊢ (((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) → ∃𝑛 ∈ 𝐵 𝑠 = (𝑛 · 𝑦))
48	41, 47	r19.29a 3163	. . . . . . . . . . 11 ⊢ (((((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) ∧ 𝑚 ∈ 𝐵) ∧ 𝑟 = (𝑚 · 𝑥)) → (𝑟 · 𝑠) ∈ 𝑃)
49		simplr 768	. . . . . . . . . . . 12 ⊢ (((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) → 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥}))
50	4, 5, 12	rspsnel 32453	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵) → (𝑟 ∈ ((RSpan‘𝑅)‘{𝑥}) ↔ ∃𝑚 ∈ 𝐵 𝑟 = (𝑚 · 𝑥)))
51	50	biimpa 478	. . . . . . . . . . . 12 ⊢ (((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) → ∃𝑚 ∈ 𝐵 𝑟 = (𝑚 · 𝑥))
52	42, 26, 49, 51	syl21anc 837	. . . . . . . . . . 11 ⊢ (((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) → ∃𝑚 ∈ 𝐵 𝑟 = (𝑚 · 𝑥))
53	48, 52	r19.29a 3163	. . . . . . . . . 10 ⊢ (((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ 𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})) → (𝑟 · 𝑠) ∈ 𝑃)
54	53	anasss 468	. . . . . . . . 9 ⊢ ((((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) ∧ (𝑟 ∈ ((RSpan‘𝑅)‘{𝑥}) ∧ 𝑠 ∈ ((RSpan‘𝑅)‘{𝑦}))) → (𝑟 · 𝑠) ∈ 𝑃)
55	54	ralrimivva 3201	. . . . . . . 8 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → ∀𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})∀𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})(𝑟 · 𝑠) ∈ 𝑃)
56	4, 5	prmidl 32516	. . . . . . . 8 ⊢ ((((𝑅 ∈ Ring ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (((RSpan‘𝑅)‘{𝑥}) ∈ (LIdeal‘𝑅) ∧ ((RSpan‘𝑅)‘{𝑦}) ∈ (LIdeal‘𝑅))) ∧ ∀𝑟 ∈ ((RSpan‘𝑅)‘{𝑥})∀𝑠 ∈ ((RSpan‘𝑅)‘{𝑦})(𝑟 · 𝑠) ∈ 𝑃) → (((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 ∨ ((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃))
57	8, 9, 20, 55, 56	syl1111anc 839	. . . . . . 7 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → (((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 ∨ ((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃))
58	4, 12	rspsnid 32454	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ ((RSpan‘𝑅)‘{𝑥}))
59	1, 58	sylan 581	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ CRing ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ ((RSpan‘𝑅)‘{𝑥}))
60	59	adantr 482	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRing ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑥 ∈ ((RSpan‘𝑅)‘{𝑥}))
61		ssel 3974	. . . . . . . . . . 11 ⊢ (((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 → (𝑥 ∈ ((RSpan‘𝑅)‘{𝑥}) → 𝑥 ∈ 𝑃))
62	60, 61	syl5com 31	. . . . . . . . . 10 ⊢ (((𝑅 ∈ CRing ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 → 𝑥 ∈ 𝑃))
63	4, 12	rspsnid 32454	. . . . . . . . . . . . 13 ⊢ ((𝑅 ∈ Ring ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ((RSpan‘𝑅)‘{𝑦}))
64	1, 63	sylan 581	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ CRing ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ((RSpan‘𝑅)‘{𝑦}))
65	64	adantlr 714	. . . . . . . . . . 11 ⊢ (((𝑅 ∈ CRing ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ ((RSpan‘𝑅)‘{𝑦}))
66		ssel 3974	. . . . . . . . . . 11 ⊢ (((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃 → (𝑦 ∈ ((RSpan‘𝑅)‘{𝑦}) → 𝑦 ∈ 𝑃))
67	65, 66	syl5com 31	. . . . . . . . . 10 ⊢ (((𝑅 ∈ CRing ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃 → 𝑦 ∈ 𝑃))
68	62, 67	orim12d 964	. . . . . . . . 9 ⊢ (((𝑅 ∈ CRing ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 ∨ ((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃) → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))
69	68	adantllr 718	. . . . . . . 8 ⊢ ((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 ∨ ((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃) → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))
70	69	adantr 482	. . . . . . 7 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → ((((RSpan‘𝑅)‘{𝑥}) ⊆ 𝑃 ∨ ((RSpan‘𝑅)‘{𝑦}) ⊆ 𝑃) → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))
71	57, 70	mpd 15	. . . . . 6 ⊢ (((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 · 𝑦) ∈ 𝑃) → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃))
72	71	ex 414	. . . . 5 ⊢ ((((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ 𝑥 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))
73	72	anasss 468	. . . 4 ⊢ (((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))
74	73	ralrimivva 3201	. . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))
75	3, 7, 74	3jca 1129	. 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑃 ∈ (PrmIdeal‘𝑅)) → (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃))))
76		3anass 1096	. . . 4 ⊢ ((𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃))) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ (𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))))
77	4, 5	prmidl2 32517	. . . . 5 ⊢ (((𝑅 ∈ Ring ∧ 𝑃 ∈ (LIdeal‘𝑅)) ∧ (𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))) → 𝑃 ∈ (PrmIdeal‘𝑅))
78	77	anasss 468	. . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑃 ∈ (LIdeal‘𝑅) ∧ (𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃))))) → 𝑃 ∈ (PrmIdeal‘𝑅))
79	76, 78	sylan2b 595	. . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))) → 𝑃 ∈ (PrmIdeal‘𝑅))
80	1, 79	sylan 581	. 2 ⊢ ((𝑅 ∈ CRing ∧ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))) → 𝑃 ∈ (PrmIdeal‘𝑅))
81	75, 80	impbida 800	1 ⊢ (𝑅 ∈ CRing → (𝑃 ∈ (PrmIdeal‘𝑅) ↔ (𝑃 ∈ (LIdeal‘𝑅) ∧ 𝑃 ≠ 𝐵 ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) ∈ 𝑃 → (𝑥 ∈ 𝑃 ∨ 𝑦 ∈ 𝑃)))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 ⊆ wss 3947 {csn 4627 ‘cfv 6540 (class class class)co 7404 Basecbs 17140 ._rcmulr 17194 Ringcrg 20047 CRingccrg 20048 LIdealclidl 20771 RSpancrsp 20772 PrmIdealcprmidl 32511

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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7720 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7360 df-ov 7407 df-oprab 7408 df-mpo 7409 df-om 7851 df-1st 7970 df-2nd 7971 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-sca 17209 df-vsca 17210 df-ip 17211 df-0g 17383 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-grp 18818 df-minusg 18819 df-sbg 18820 df-subg 18997 df-cmn 19643 df-mgp 19980 df-ur 19997 df-ring 20049 df-cring 20050 df-subrg 20349 df-lmod 20461 df-lss 20531 df-lsp 20571 df-sra 20773 df-rgmod 20774 df-lidl 20775 df-rsp 20776 df-prmidl 32512

This theorem is referenced by: prmidlc 32525 prmidl0 32527 qsidomlem2 32530

W3C validator