Theorem 1arithufdlem4 33507

Description: Lemma for 1arithufd 33508. Nonzero ring, non-field case. Those trivial cases are handled in the final proof. (Contributed by Thierry Arnoux, 3-Jun-2025.)

Hypotheses

Ref	Expression
1arithufd.b	⊢ 𝐵 = (Base‘𝑅)
1arithufd.0	⊢ 0 = (0g‘𝑅)
1arithufd.u	⊢ 𝑈 = (Unit‘𝑅)
1arithufd.p	⊢ 𝑃 = (RPrime‘𝑅)
1arithufd.m	⊢ 𝑀 = (mulGrp‘𝑅)
1arithufd.r	⊢ (𝜑 → 𝑅 ∈ UFD)
1arithufdlem.2	⊢ (𝜑 → ¬ 𝑅 ∈ DivRing)
1arithufdlem.s	⊢ 𝑆 = {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)}
1arithufdlem.3	⊢ (𝜑 → 𝑋 ∈ 𝐵)
1arithufdlem.4	⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈)
1arithufdlem.5	⊢ (𝜑 → 𝑋 ≠ 0 )

Assertion

Ref	Expression
1arithufdlem4	⊢ (𝜑 → 𝑋 ∈ 𝑆)

Distinct variable groups:   0 ,𝑓   𝑥,𝐵   𝑓,𝑀,𝑥   𝑃,𝑓,𝑥   𝑅,𝑓   𝜑,𝑓,𝑥   𝑥,𝑋   𝑥,𝑈   𝑥,𝑅   𝑥,𝑆   𝑥, 0   𝑈,𝑓   𝐵,𝑓   𝑓,𝑋   𝑆,𝑓

Proof of Theorem 1arithufdlem4

Dummy variables 𝑝 𝑖 𝑗 𝑢 𝑎 𝑏 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqeq1 2735	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → (𝑥 = (𝑀 Σg 𝑓) ↔ 𝑎 = (𝑀 Σg 𝑓)))
2	1	rexbidv 3156	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃𝑎 = (𝑀 Σg 𝑓)))
3		eqcom 2738	. . . . . . . . 9 ⊢ (𝑎 = (𝑀 Σg 𝑓) ↔ (𝑀 Σg 𝑓) = 𝑎)
4	3	rexbii 3079	. . . . . . . 8 ⊢ (∃𝑓 ∈ Word 𝑃𝑎 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = 𝑎)
5	2, 4	bitrdi 287	. . . . . . 7 ⊢ (𝑥 = 𝑎 → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = 𝑎))
6		1arithufd.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
7		1arithufd.p	. . . . . . . 8 ⊢ 𝑃 = (RPrime‘𝑅)
8		1arithufd.r	. . . . . . . . 9 ⊢ (𝜑 → 𝑅 ∈ UFD)
9	8	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑅 ∈ UFD)
10		simpr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝑃)
11	6, 7, 9, 10	rprmcl 33478	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝐵)
12		oveq2 7354	. . . . . . . . 9 ⊢ (𝑓 = ⟨“𝑎”⟩ → (𝑀 Σg 𝑓) = (𝑀 Σg ⟨“𝑎”⟩))
13	12	eqeq1d 2733	. . . . . . . 8 ⊢ (𝑓 = ⟨“𝑎”⟩ → ((𝑀 Σg 𝑓) = 𝑎 ↔ (𝑀 Σg ⟨“𝑎”⟩) = 𝑎))
14	10	s1cld 14508	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → ⟨“𝑎”⟩ ∈ Word 𝑃)
15		1arithufd.m	. . . . . . . . . . 11 ⊢ 𝑀 = (mulGrp‘𝑅)
16	15, 6	mgpbas 20061	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑀)
17	16	gsumws1 18743	. . . . . . . . 9 ⊢ (𝑎 ∈ 𝐵 → (𝑀 Σg ⟨“𝑎”⟩) = 𝑎)
18	11, 17	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → (𝑀 Σg ⟨“𝑎”⟩) = 𝑎)
19	13, 14, 18	rspcedvdw 3580	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = 𝑎)
20	5, 11, 19	elrabd 3649	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)})
21		1arithufdlem.s	. . . . . 6 ⊢ 𝑆 = {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)}
22	20, 21	eleqtrrdi 2842	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝑆)
23	22	ex 412	. . . 4 ⊢ (𝜑 → (𝑎 ∈ 𝑃 → 𝑎 ∈ 𝑆))
24	23	ssrdv 3940	. . 3 ⊢ (𝜑 → 𝑃 ⊆ 𝑆)
25	24	adantr 480	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑃 ⊆ 𝑆)
26		anass 468	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ↔ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ (𝑖 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))))
27		ineq2 4164	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑖 → (𝑆 ∩ 𝑝) = (𝑆 ∩ 𝑖))
28	27	eqeq1d 2733	. . . . . . . . . 10 ⊢ (𝑝 = 𝑖 → ((𝑆 ∩ 𝑝) = ∅ ↔ (𝑆 ∩ 𝑖) = ∅))
29		sseq2 3961	. . . . . . . . . 10 ⊢ (𝑝 = 𝑖 → (((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝 ↔ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))
30	28, 29	anbi12d 632	. . . . . . . . 9 ⊢ (𝑝 = 𝑖 → (((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝) ↔ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)))
31	30	elrab 3647	. . . . . . . 8 ⊢ (𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ↔ (𝑖 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)))
32	31	anbi2i 623	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ↔ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ (𝑖 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))))
33	26, 32	bitr4i 278	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ↔ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}))
34	33	anbi1i 624	. . . . 5 ⊢ (((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ↔ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)))
35		incom 4159	. . . . . . 7 ⊢ (𝑖 ∩ 𝑆) = (𝑆 ∩ 𝑖)
36		simpllr 775	. . . . . . . 8 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))
37	36	simpld 494	. . . . . . 7 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → (𝑆 ∩ 𝑖) = ∅)
38	35, 37	eqtrid 2778	. . . . . 6 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → (𝑖 ∩ 𝑆) = ∅)
39	8	ad5antr 734	. . . . . . 7 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑅 ∈ UFD)
40		simplr 768	. . . . . . . 8 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑖 ∈ (PrmIdeal‘𝑅))
41	36	simprd 495	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)
42	8	ufdidom 33502	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ IDomn)
43	42	idomringd 20641	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ Ring)
44		1arithufdlem.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
45		eqid 2731	. . . . . . . . . . . . 13 ⊢ (RSpan‘𝑅) = (RSpan‘𝑅)
46	6, 45	rspsnid 33331	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ ((RSpan‘𝑅)‘{𝑋}))
47	43, 44, 46	syl2anc 584	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ((RSpan‘𝑅)‘{𝑋}))
48	47	ad5antr 734	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑋 ∈ ((RSpan‘𝑅)‘{𝑋}))
49	41, 48	sseldd 3935	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑋 ∈ 𝑖)
50		1arithufdlem.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ≠ 0 )
51		nelsn 4619	. . . . . . . . . . 11 ⊢ (𝑋 ≠ 0 → ¬ 𝑋 ∈ { 0 })
52	50, 51	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑋 ∈ { 0 })
53	52	ad5antr 734	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ¬ 𝑋 ∈ { 0 })
54		nelne1 3025	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑖 ∧ ¬ 𝑋 ∈ { 0 }) → 𝑖 ≠ { 0 })
55	49, 53, 54	syl2anc 584	. . . . . . . 8 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑖 ≠ { 0 })
56	40, 55	eldifsnd 4739	. . . . . . 7 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }}))
57		ineq1 4163	. . . . . . . . 9 ⊢ (𝑗 = 𝑖 → (𝑗 ∩ 𝑃) = (𝑖 ∩ 𝑃))
58	57	neeq1d 2987	. . . . . . . 8 ⊢ (𝑗 = 𝑖 → ((𝑗 ∩ 𝑃) ≠ ∅ ↔ (𝑖 ∩ 𝑃) ≠ ∅))
59		eqid 2731	. . . . . . . . . . 11 ⊢ (PrmIdeal‘𝑅) = (PrmIdeal‘𝑅)
60		1arithufd.0	. . . . . . . . . . 11 ⊢ 0 = (0g‘𝑅)
61	59, 7, 60	isufd 33500	. . . . . . . . . 10 ⊢ (𝑅 ∈ UFD ↔ (𝑅 ∈ IDomn ∧ ∀𝑗 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})(𝑗 ∩ 𝑃) ≠ ∅))
62	61	simprbi 496	. . . . . . . . 9 ⊢ (𝑅 ∈ UFD → ∀𝑗 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})(𝑗 ∩ 𝑃) ≠ ∅)
63	62	adantr 480	. . . . . . . 8 ⊢ ((𝑅 ∈ UFD ∧ 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})) → ∀𝑗 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})(𝑗 ∩ 𝑃) ≠ ∅)
64		simpr 484	. . . . . . . 8 ⊢ ((𝑅 ∈ UFD ∧ 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})) → 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }}))
65	58, 63, 64	rspcdva 3578	. . . . . . 7 ⊢ ((𝑅 ∈ UFD ∧ 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})) → (𝑖 ∩ 𝑃) ≠ ∅)
66	39, 56, 65	syl2anc 584	. . . . . 6 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → (𝑖 ∩ 𝑃) ≠ ∅)
67		sseq0 4353	. . . . . . . . 9 ⊢ (((𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆) ∧ (𝑖 ∩ 𝑆) = ∅) → (𝑖 ∩ 𝑃) = ∅)
68	67	expcom 413	. . . . . . . 8 ⊢ ((𝑖 ∩ 𝑆) = ∅ → ((𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆) → (𝑖 ∩ 𝑃) = ∅))
69	68	necon3ad 2941	. . . . . . 7 ⊢ ((𝑖 ∩ 𝑆) = ∅ → ((𝑖 ∩ 𝑃) ≠ ∅ → ¬ (𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆)))
70		sslin 4193	. . . . . . . 8 ⊢ (𝑃 ⊆ 𝑆 → (𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆))
71	70	con3i 154	. . . . . . 7 ⊢ (¬ (𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆) → ¬ 𝑃 ⊆ 𝑆)
72	69, 71	syl6 35	. . . . . 6 ⊢ ((𝑖 ∩ 𝑆) = ∅ → ((𝑖 ∩ 𝑃) ≠ ∅ → ¬ 𝑃 ⊆ 𝑆))
73	38, 66, 72	sylc 65	. . . . 5 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ¬ 𝑃 ⊆ 𝑆)
74	34, 73	sylanbr 582	. . . 4 ⊢ (((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ¬ 𝑃 ⊆ 𝑆)
75	74	anasss 466	. . 3 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ∧ (𝑖 ∈ (PrmIdeal‘𝑅) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗)) → ¬ 𝑃 ⊆ 𝑆)
76	42	idomcringd 20640	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ CRing)
77	76	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑅 ∈ CRing)
78	43	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑅 ∈ Ring)
79	44	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵)
80	79	snssd 4761	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → {𝑋} ⊆ 𝐵)
81		eqid 2731	. . . . . 6 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
82	45, 6, 81	rspcl 21170	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ {𝑋} ⊆ 𝐵) → ((RSpan‘𝑅)‘{𝑋}) ∈ (LIdeal‘𝑅))
83	78, 80, 82	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → ((RSpan‘𝑅)‘{𝑋}) ∈ (LIdeal‘𝑅))
84	15	ringmgp 20155	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑀 ∈ Mnd)
85	43, 84	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ Mnd)
86	21	ssrab3 4032	. . . . . . 7 ⊢ 𝑆 ⊆ 𝐵
87	86	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
88		eqeq1 2735	. . . . . . . . . 10 ⊢ (𝑥 = (1r‘𝑅) → (𝑥 = (𝑀 Σg 𝑓) ↔ (1r‘𝑅) = (𝑀 Σg 𝑓)))
89	88	rexbidv 3156	. . . . . . . . 9 ⊢ (𝑥 = (1r‘𝑅) → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(1r‘𝑅) = (𝑀 Σg 𝑓)))
90		eqcom 2738	. . . . . . . . . 10 ⊢ ((1r‘𝑅) = (𝑀 Σg 𝑓) ↔ (𝑀 Σg 𝑓) = (1r‘𝑅))
91	90	rexbii 3079	. . . . . . . . 9 ⊢ (∃𝑓 ∈ Word 𝑃(1r‘𝑅) = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = (1r‘𝑅))
92	89, 91	bitrdi 287	. . . . . . . 8 ⊢ (𝑥 = (1r‘𝑅) → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = (1r‘𝑅)))
93		eqid 2731	. . . . . . . . . 10 ⊢ (1r‘𝑅) = (1r‘𝑅)
94	6, 93	ringidcl 20181	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵)
95	43, 94	syl 17	. . . . . . . 8 ⊢ (𝜑 → (1r‘𝑅) ∈ 𝐵)
96		oveq2 7354	. . . . . . . . . 10 ⊢ (𝑓 = ∅ → (𝑀 Σg 𝑓) = (𝑀 Σg ∅))
97	96	eqeq1d 2733	. . . . . . . . 9 ⊢ (𝑓 = ∅ → ((𝑀 Σg 𝑓) = (1r‘𝑅) ↔ (𝑀 Σg ∅) = (1r‘𝑅)))
98		wrd0 14443	. . . . . . . . . 10 ⊢ ∅ ∈ Word 𝑃
99	98	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ∅ ∈ Word 𝑃)
100	15, 93	ringidval 20099	. . . . . . . . . . 11 ⊢ (1r‘𝑅) = (0g‘𝑀)
101	100	gsum0 18589	. . . . . . . . . 10 ⊢ (𝑀 Σg ∅) = (1r‘𝑅)
102	101	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 Σg ∅) = (1r‘𝑅))
103	97, 99, 102	rspcedvdw 3580	. . . . . . . 8 ⊢ (𝜑 → ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = (1r‘𝑅))
104	92, 95, 103	elrabd 3649	. . . . . . 7 ⊢ (𝜑 → (1r‘𝑅) ∈ {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)})
105	104, 21	eleqtrrdi 2842	. . . . . 6 ⊢ (𝜑 → (1r‘𝑅) ∈ 𝑆)
106		1arithufd.u	. . . . . . . . 9 ⊢ 𝑈 = (Unit‘𝑅)
107	8	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → 𝑅 ∈ UFD)
108		1arithufdlem.2	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑅 ∈ DivRing)
109	108	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → ¬ 𝑅 ∈ DivRing)
110		eqid 2731	. . . . . . . . 9 ⊢ (.r‘𝑅) = (.r‘𝑅)
111		simplr 768	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → 𝑎 ∈ 𝑆)
112		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → 𝑏 ∈ 𝑆)
113	6, 60, 106, 7, 15, 107, 109, 21, 110, 111, 112	1arithufdlem2 33505	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)
114	113	anasss 466	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)
115	114	ralrimivva 3175	. . . . . 6 ⊢ (𝜑 → ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)
116	15, 110	mgpplusg 20060	. . . . . . . 8 ⊢ (.r‘𝑅) = (+g‘𝑀)
117	16, 100, 116	issubm 18708	. . . . . . 7 ⊢ (𝑀 ∈ Mnd → (𝑆 ∈ (SubMnd‘𝑀) ↔ (𝑆 ⊆ 𝐵 ∧ (1r‘𝑅) ∈ 𝑆 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)))
118	117	biimpar 477	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ (𝑆 ⊆ 𝐵 ∧ (1r‘𝑅) ∈ 𝑆 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)) → 𝑆 ∈ (SubMnd‘𝑀))
119	85, 87, 105, 115, 118	syl13anc 1374	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ (SubMnd‘𝑀))
120	119	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑆 ∈ (SubMnd‘𝑀))
121		neq0 4302	. . . . . . . . 9 ⊢ (¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅ ↔ ∃𝑢 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
122	121	biimpi 216	. . . . . . . 8 ⊢ (¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅ → ∃𝑢 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
123	122	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → ∃𝑢 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
124	8	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑅 ∈ UFD)
125	108	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → ¬ 𝑅 ∈ DivRing)
126	44	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑋 ∈ 𝐵)
127		1arithufdlem.4	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈)
128	127	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → ¬ 𝑋 ∈ 𝑈)
129	50	ad4antr 732	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑋 ≠ 0 )
130		simplr 768	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑦 ∈ 𝐵)
131		simpr 484	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑢 = (𝑦(.r‘𝑅)𝑋))
132		simpllr 775	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
133	132	elin1d 4154	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑢 ∈ 𝑆)
134	131, 133	eqeltrrd 2832	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → (𝑦(.r‘𝑅)𝑋) ∈ 𝑆)
135	6, 60, 106, 7, 15, 124, 125, 21, 126, 128, 129, 110, 130, 134	1arithufdlem3 33506	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑋 ∈ 𝑆)
136	43	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑅 ∈ Ring)
137	44	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑋 ∈ 𝐵)
138		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
139	138	elin2d 4155	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑢 ∈ ((RSpan‘𝑅)‘{𝑋}))
140	6, 110, 45	elrspsn 21175	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑢 ∈ ((RSpan‘𝑅)‘{𝑋}) ↔ ∃𝑦 ∈ 𝐵 𝑢 = (𝑦(.r‘𝑅)𝑋)))
141	140	biimpa 476	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑢 ∈ ((RSpan‘𝑅)‘{𝑋})) → ∃𝑦 ∈ 𝐵 𝑢 = (𝑦(.r‘𝑅)𝑋))
142	136, 137, 139, 141	syl21anc 837	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → ∃𝑦 ∈ 𝐵 𝑢 = (𝑦(.r‘𝑅)𝑋))
143	135, 142	r19.29a 3140	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑋 ∈ 𝑆)
144	123, 143	exlimddv 1936	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → 𝑋 ∈ 𝑆)
145	144	adantlr 715	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → 𝑋 ∈ 𝑆)
146		simplr 768	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → ¬ 𝑋 ∈ 𝑆)
147	145, 146	condan 817	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅)
148		eqid 2731	. . . 4 ⊢ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} = {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}
149	6, 77, 83, 120, 15, 147, 148	ssdifidlprm 33418	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → ∃𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} (𝑖 ∈ (PrmIdeal‘𝑅) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗))
150	75, 149	r19.29a 3140	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → ¬ 𝑃 ⊆ 𝑆)
151	25, 150	condan 817	1 ⊢ (𝜑 → 𝑋 ∈ 𝑆)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1541  ∃wex 1780   ∈ wcel 2111   ≠ wne 2928  ∀wral 3047  ∃wrex 3056  {crab 3395   ∖ cdif 3899   ∩ cin 3901   ⊆ wss 3902   ⊊ wpss 3903  ∅c0 4283  {csn 4576  ‘cfv 6481  (class class class)co 7346  Word cword 14417  ⟨“cs1 14500  Basecbs 17117  ._rcmulr 17159  0_gc0g 17340   Σ_g cgsu 17341  Mndcmnd 18639  SubMndcsubmnd 18687  mulGrpcmgp 20056  1_rcur 20097  Ringcrg 20149  CRingccrg 20150  Unitcui 20271  RPrimecrpm 20348  IDomncidom 20606  DivRingcdr 20642  LIdealclidl 21141  RSpancrsp 21142  PrmIdealcprmidl 33395  UFDcufd 33498

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-rep 5217  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-ac2 10351  ax-cnex 11059  ax-resscn 11060  ax-1cn 11061  ax-icn 11062  ax-addcl 11063  ax-addrcl 11064  ax-mulcl 11065  ax-mulrcl 11066  ax-mulcom 11067  ax-addass 11068  ax-mulass 11069  ax-distr 11070  ax-i2m1 11071  ax-1ne0 11072  ax-1rid 11073  ax-rnegex 11074  ax-rrecex 11075  ax-cnre 11076  ax-pre-lttri 11077  ax-pre-lttrn 11078  ax-pre-ltadd 11079  ax-pre-mulgt0 11080

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rmo 3346  df-reu 3347  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-int 4898  df-iun 4943  df-br 5092  df-opab 5154  df-mpt 5173  df-tr 5199  df-id 5511  df-eprel 5516  df-po 5524  df-so 5525  df-fr 5569  df-se 5570  df-we 5571  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-pred 6248  df-ord 6309  df-on 6310  df-lim 6311  df-suc 6312  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-isom 6490  df-riota 7303  df-ov 7349  df-oprab 7350  df-mpo 7351  df-rpss 7656  df-om 7797  df-1st 7921  df-2nd 7922  df-supp 8091  df-tpos 8156  df-frecs 8211  df-wrecs 8242  df-recs 8291  df-rdg 8329  df-1o 8385  df-oadd 8389  df-er 8622  df-en 8870  df-dom 8871  df-sdom 8872  df-fin 8873  df-fsupp 9246  df-oi 9396  df-dju 9791  df-card 9829  df-ac 10004  df-pnf 11145  df-mnf 11146  df-xr 11147  df-ltxr 11148  df-le 11149  df-sub 11343  df-neg 11344  df-nn 12123  df-2 12185  df-3 12186  df-4 12187  df-5 12188  df-6 12189  df-7 12190  df-8 12191  df-n0 12379  df-xnn0 12452  df-z 12466  df-uz 12730  df-fz 13405  df-fzo 13552  df-seq 13906  df-hash 14235  df-word 14418  df-lsw 14467  df-concat 14475  df-s1 14501  df-substr 14546  df-pfx 14576  df-sets 17072  df-slot 17090  df-ndx 17102  df-base 17118  df-ress 17139  df-plusg 17171  df-mulr 17172  df-sca 17174  df-vsca 17175  df-ip 17176  df-0g 17342  df-gsum 17343  df-mgm 18545  df-sgrp 18624  df-mnd 18640  df-submnd 18689  df-grp 18846  df-minusg 18847  df-sbg 18848  df-subg 19033  df-cntz 19227  df-lsm 19546  df-cmn 19692  df-abl 19693  df-mgp 20057  df-rng 20069  df-ur 20098  df-ring 20151  df-cring 20152  df-oppr 20253  df-dvdsr 20273  df-unit 20274  df-invr 20304  df-rprm 20349  df-nzr 20426  df-subrg 20483  df-domn 20608  df-idom 20609  df-lmod 20793  df-lss 20863  df-lsp 20903  df-sra 21105  df-rgmod 21106  df-lidl 21143  df-rsp 21144  df-prmidl 33396  df-ufd 33499

This theorem is referenced by:  1arithufd  33508