Theorem 1arithufdlem4 33622

Description: Lemma for 1arithufd 33623. 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 2741	. . . . . . . . 9 ⊢ (𝑥 = 𝑎 → (𝑥 = (𝑀 Σg 𝑓) ↔ 𝑎 = (𝑀 Σg 𝑓)))
2	1	rexbidv 3162	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃𝑎 = (𝑀 Σg 𝑓)))
3		eqcom 2744	. . . . . . . . 9 ⊢ (𝑎 = (𝑀 Σg 𝑓) ↔ (𝑀 Σg 𝑓) = 𝑎)
4	3	rexbii 3085	. . . . . . . 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 33593	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝐵)
12		oveq2 7368	. . . . . . . . 9 ⊢ (𝑓 = ⟨“𝑎”⟩ → (𝑀 Σg 𝑓) = (𝑀 Σg ⟨“𝑎”⟩))
13	12	eqeq1d 2739	. . . . . . . 8 ⊢ (𝑓 = ⟨“𝑎”⟩ → ((𝑀 Σg 𝑓) = 𝑎 ↔ (𝑀 Σg ⟨“𝑎”⟩) = 𝑎))
14	10	s1cld 14557	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → ⟨“𝑎”⟩ ∈ Word 𝑃)
15		1arithufd.m	. . . . . . . . . . 11 ⊢ 𝑀 = (mulGrp‘𝑅)
16	15, 6	mgpbas 20117	. . . . . . . . . 10 ⊢ 𝐵 = (Base‘𝑀)
17	16	gsumws1 18797	. . . . . . . . 9 ⊢ (𝑎 ∈ 𝐵 → (𝑀 Σg ⟨“𝑎”⟩) = 𝑎)
18	11, 17	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → (𝑀 Σg ⟨“𝑎”⟩) = 𝑎)
19	13, 14, 18	rspcedvdw 3568	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = 𝑎)
20	5, 11, 19	elrabd 3637	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)})
21		1arithufdlem.s	. . . . . 6 ⊢ 𝑆 = {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)}
22	20, 21	eleqtrrdi 2848	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑃) → 𝑎 ∈ 𝑆)
23	22	ex 412	. . . 4 ⊢ (𝜑 → (𝑎 ∈ 𝑃 → 𝑎 ∈ 𝑆))
24	23	ssrdv 3928	. . 3 ⊢ (𝜑 → 𝑃 ⊆ 𝑆)
25	24	adantr 480	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑃 ⊆ 𝑆)
26		anass 468	. . . . . . 7 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ↔ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ (𝑖 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))))
27		ineq2 4155	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑖 → (𝑆 ∩ 𝑝) = (𝑆 ∩ 𝑖))
28	27	eqeq1d 2739	. . . . . . . . . 10 ⊢ (𝑝 = 𝑖 → ((𝑆 ∩ 𝑝) = ∅ ↔ (𝑆 ∩ 𝑖) = ∅))
29		sseq2 3949	. . . . . . . . . 10 ⊢ (𝑝 = 𝑖 → (((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝 ↔ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))
30	28, 29	anbi12d 633	. . . . . . . . 9 ⊢ (𝑝 = 𝑖 → (((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝) ↔ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)))
31	30	elrab 3635	. . . . . . . 8 ⊢ (𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ↔ (𝑖 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)))
32	31	anbi2i 624	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ↔ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ (𝑖 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))))
33	26, 32	bitr4i 278	. . . . . 6 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ↔ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}))
34	33	anbi1i 625	. . . . 5 ⊢ (((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ↔ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)))
35		incom 4150	. . . . . . 7 ⊢ (𝑖 ∩ 𝑆) = (𝑆 ∩ 𝑖)
36		simpllr 776	. . . . . . . 8 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖))
37	36	simpld 494	. . . . . . 7 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → (𝑆 ∩ 𝑖) = ∅)
38	35, 37	eqtrid 2784	. . . . . 6 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → (𝑖 ∩ 𝑆) = ∅)
39	8	ad5antr 735	. . . . . . 7 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑅 ∈ UFD)
40		simplr 769	. . . . . . . 8 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑖 ∈ (PrmIdeal‘𝑅))
41	36	simprd 495	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)
42	8	ufdidom 33617	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑅 ∈ IDomn)
43	42	idomringd 20696	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑅 ∈ Ring)
44		1arithufdlem.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑋 ∈ 𝐵)
45		eqid 2737	. . . . . . . . . . . . 13 ⊢ (RSpan‘𝑅) = (RSpan‘𝑅)
46	6, 45	rspsnid 33446	. . . . . . . . . . . 12 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → 𝑋 ∈ ((RSpan‘𝑅)‘{𝑋}))
47	43, 44, 46	syl2anc 585	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ((RSpan‘𝑅)‘{𝑋}))
48	47	ad5antr 735	. . . . . . . . . 10 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑋 ∈ ((RSpan‘𝑅)‘{𝑋}))
49	41, 48	sseldd 3923	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑋 ∈ 𝑖)
50		1arithufdlem.5	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ≠ 0 )
51		nelsn 4611	. . . . . . . . . . 11 ⊢ (𝑋 ≠ 0 → ¬ 𝑋 ∈ { 0 })
52	50, 51	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑋 ∈ { 0 })
53	52	ad5antr 735	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ¬ 𝑋 ∈ { 0 })
54		nelne1 3030	. . . . . . . . 9 ⊢ ((𝑋 ∈ 𝑖 ∧ ¬ 𝑋 ∈ { 0 }) → 𝑖 ≠ { 0 })
55	49, 53, 54	syl2anc 585	. . . . . . . 8 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑖 ≠ { 0 })
56	40, 55	eldifsnd 4731	. . . . . . 7 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }}))
57		ineq1 4154	. . . . . . . . 9 ⊢ (𝑗 = 𝑖 → (𝑗 ∩ 𝑃) = (𝑖 ∩ 𝑃))
58	57	neeq1d 2992	. . . . . . . 8 ⊢ (𝑗 = 𝑖 → ((𝑗 ∩ 𝑃) ≠ ∅ ↔ (𝑖 ∩ 𝑃) ≠ ∅))
59		eqid 2737	. . . . . . . . . . 11 ⊢ (PrmIdeal‘𝑅) = (PrmIdeal‘𝑅)
60		1arithufd.0	. . . . . . . . . . 11 ⊢ 0 = (0g‘𝑅)
61	59, 7, 60	isufd 33615	. . . . . . . . . 10 ⊢ (𝑅 ∈ UFD ↔ (𝑅 ∈ IDomn ∧ ∀𝑗 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})(𝑗 ∩ 𝑃) ≠ ∅))
62	61	simprbi 497	. . . . . . . . 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 3566	. . . . . . 7 ⊢ ((𝑅 ∈ UFD ∧ 𝑖 ∈ ((PrmIdeal‘𝑅) ∖ {{ 0 }})) → (𝑖 ∩ 𝑃) ≠ ∅)
66	39, 56, 65	syl2anc 585	. . . . . 6 ⊢ ((((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑆 ∩ 𝑖) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑖)) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → (𝑖 ∩ 𝑃) ≠ ∅)
67		sseq0 4344	. . . . . . . . 9 ⊢ (((𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆) ∧ (𝑖 ∩ 𝑆) = ∅) → (𝑖 ∩ 𝑃) = ∅)
68	67	expcom 413	. . . . . . . 8 ⊢ ((𝑖 ∩ 𝑆) = ∅ → ((𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆) → (𝑖 ∩ 𝑃) = ∅))
69	68	necon3ad 2946	. . . . . . 7 ⊢ ((𝑖 ∩ 𝑆) = ∅ → ((𝑖 ∩ 𝑃) ≠ ∅ → ¬ (𝑖 ∩ 𝑃) ⊆ (𝑖 ∩ 𝑆)))
70		sslin 4184	. . . . . . . 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 583	. . . 4 ⊢ (((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ∧ 𝑖 ∈ (PrmIdeal‘𝑅)) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗) → ¬ 𝑃 ⊆ 𝑆)
75	74	anasss 466	. . 3 ⊢ ((((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ 𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}) ∧ (𝑖 ∈ (PrmIdeal‘𝑅) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗)) → ¬ 𝑃 ⊆ 𝑆)
76	42	idomcringd 20695	. . . . 5 ⊢ (𝜑 → 𝑅 ∈ CRing)
77	76	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑅 ∈ CRing)
78	43	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑅 ∈ Ring)
79	44	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵)
80	79	snssd 4753	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → {𝑋} ⊆ 𝐵)
81		eqid 2737	. . . . . 6 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
82	45, 6, 81	rspcl 21225	. . . . 5 ⊢ ((𝑅 ∈ Ring ∧ {𝑋} ⊆ 𝐵) → ((RSpan‘𝑅)‘{𝑋}) ∈ (LIdeal‘𝑅))
83	78, 80, 82	syl2anc 585	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → ((RSpan‘𝑅)‘{𝑋}) ∈ (LIdeal‘𝑅))
84	15	ringmgp 20211	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝑀 ∈ Mnd)
85	43, 84	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ Mnd)
86	21	ssrab3 4023	. . . . . . 7 ⊢ 𝑆 ⊆ 𝐵
87	86	a1i 11	. . . . . 6 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
88		eqeq1 2741	. . . . . . . . . 10 ⊢ (𝑥 = (1r‘𝑅) → (𝑥 = (𝑀 Σg 𝑓) ↔ (1r‘𝑅) = (𝑀 Σg 𝑓)))
89	88	rexbidv 3162	. . . . . . . . 9 ⊢ (𝑥 = (1r‘𝑅) → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(1r‘𝑅) = (𝑀 Σg 𝑓)))
90		eqcom 2744	. . . . . . . . . 10 ⊢ ((1r‘𝑅) = (𝑀 Σg 𝑓) ↔ (𝑀 Σg 𝑓) = (1r‘𝑅))
91	90	rexbii 3085	. . . . . . . . 9 ⊢ (∃𝑓 ∈ Word 𝑃(1r‘𝑅) = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = (1r‘𝑅))
92	89, 91	bitrdi 287	. . . . . . . 8 ⊢ (𝑥 = (1r‘𝑅) → (∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓) ↔ ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = (1r‘𝑅)))
93		eqid 2737	. . . . . . . . . 10 ⊢ (1r‘𝑅) = (1r‘𝑅)
94	6, 93	ringidcl 20237	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → (1r‘𝑅) ∈ 𝐵)
95	43, 94	syl 17	. . . . . . . 8 ⊢ (𝜑 → (1r‘𝑅) ∈ 𝐵)
96		oveq2 7368	. . . . . . . . . 10 ⊢ (𝑓 = ∅ → (𝑀 Σg 𝑓) = (𝑀 Σg ∅))
97	96	eqeq1d 2739	. . . . . . . . 9 ⊢ (𝑓 = ∅ → ((𝑀 Σg 𝑓) = (1r‘𝑅) ↔ (𝑀 Σg ∅) = (1r‘𝑅)))
98		wrd0 14492	. . . . . . . . . 10 ⊢ ∅ ∈ Word 𝑃
99	98	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → ∅ ∈ Word 𝑃)
100	15, 93	ringidval 20155	. . . . . . . . . . 11 ⊢ (1r‘𝑅) = (0g‘𝑀)
101	100	gsum0 18643	. . . . . . . . . 10 ⊢ (𝑀 Σg ∅) = (1r‘𝑅)
102	101	a1i 11	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 Σg ∅) = (1r‘𝑅))
103	97, 99, 102	rspcedvdw 3568	. . . . . . . 8 ⊢ (𝜑 → ∃𝑓 ∈ Word 𝑃(𝑀 Σg 𝑓) = (1r‘𝑅))
104	92, 95, 103	elrabd 3637	. . . . . . 7 ⊢ (𝜑 → (1r‘𝑅) ∈ {𝑥 ∈ 𝐵 ∣ ∃𝑓 ∈ Word 𝑃𝑥 = (𝑀 Σg 𝑓)})
105	104, 21	eleqtrrdi 2848	. . . . . 6 ⊢ (𝜑 → (1r‘𝑅) ∈ 𝑆)
106		1arithufd.u	. . . . . . . . 9 ⊢ 𝑈 = (Unit‘𝑅)
107	8	ad2antrr 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → 𝑅 ∈ UFD)
108		1arithufdlem.2	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑅 ∈ DivRing)
109	108	ad2antrr 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → ¬ 𝑅 ∈ DivRing)
110		eqid 2737	. . . . . . . . 9 ⊢ (.r‘𝑅) = (.r‘𝑅)
111		simplr 769	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → 𝑎 ∈ 𝑆)
112		simpr 484	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → 𝑏 ∈ 𝑆)
113	6, 60, 106, 7, 15, 107, 109, 21, 110, 111, 112	1arithufdlem2 33620	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑏 ∈ 𝑆) → (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)
114	113	anasss 466	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑆 ∧ 𝑏 ∈ 𝑆)) → (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)
115	114	ralrimivva 3181	. . . . . 6 ⊢ (𝜑 → ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)
116	15, 110	mgpplusg 20116	. . . . . . . 8 ⊢ (.r‘𝑅) = (+g‘𝑀)
117	16, 100, 116	issubm 18762	. . . . . . 7 ⊢ (𝑀 ∈ Mnd → (𝑆 ∈ (SubMnd‘𝑀) ↔ (𝑆 ⊆ 𝐵 ∧ (1r‘𝑅) ∈ 𝑆 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)))
118	117	biimpar 477	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ (𝑆 ⊆ 𝐵 ∧ (1r‘𝑅) ∈ 𝑆 ∧ ∀𝑎 ∈ 𝑆 ∀𝑏 ∈ 𝑆 (𝑎(.r‘𝑅)𝑏) ∈ 𝑆)) → 𝑆 ∈ (SubMnd‘𝑀))
119	85, 87, 105, 115, 118	syl13anc 1375	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ (SubMnd‘𝑀))
120	119	adantr 480	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → 𝑆 ∈ (SubMnd‘𝑀))
121		neq0 4293	. . . . . . . . 9 ⊢ (¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅ ↔ ∃𝑢 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
122	121	biimpi 216	. . . . . . . 8 ⊢ (¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅ → ∃𝑢 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
123	122	adantl 481	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → ∃𝑢 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
124	8	ad4antr 733	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑅 ∈ UFD)
125	108	ad4antr 733	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → ¬ 𝑅 ∈ DivRing)
126	44	ad4antr 733	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑋 ∈ 𝐵)
127		1arithufdlem.4	. . . . . . . . . 10 ⊢ (𝜑 → ¬ 𝑋 ∈ 𝑈)
128	127	ad4antr 733	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → ¬ 𝑋 ∈ 𝑈)
129	50	ad4antr 733	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑋 ≠ 0 )
130		simplr 769	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑦 ∈ 𝐵)
131		simpr 484	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑢 = (𝑦(.r‘𝑅)𝑋))
132		simpllr 776	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
133	132	elin1d 4145	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑢 ∈ 𝑆)
134	131, 133	eqeltrrd 2838	. . . . . . . . 9 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → (𝑦(.r‘𝑅)𝑋) ∈ 𝑆)
135	6, 60, 106, 7, 15, 124, 125, 21, 126, 128, 129, 110, 130, 134	1arithufdlem3 33621	. . . . . . . 8 ⊢ (((((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = (𝑦(.r‘𝑅)𝑋)) → 𝑋 ∈ 𝑆)
136	43	ad2antrr 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑅 ∈ Ring)
137	44	ad2antrr 727	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑋 ∈ 𝐵)
138		simpr 484	. . . . . . . . . 10 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})))
139	138	elin2d 4146	. . . . . . . . 9 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑢 ∈ ((RSpan‘𝑅)‘{𝑋}))
140	6, 110, 45	elrspsn 21230	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑢 ∈ ((RSpan‘𝑅)‘{𝑋}) ↔ ∃𝑦 ∈ 𝐵 𝑢 = (𝑦(.r‘𝑅)𝑋)))
141	140	biimpa 476	. . . . . . . . 9 ⊢ (((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) ∧ 𝑢 ∈ ((RSpan‘𝑅)‘{𝑋})) → ∃𝑦 ∈ 𝐵 𝑢 = (𝑦(.r‘𝑅)𝑋))
142	136, 137, 139, 141	syl21anc 838	. . . . . . . 8 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → ∃𝑦 ∈ 𝐵 𝑢 = (𝑦(.r‘𝑅)𝑋))
143	135, 142	r19.29a 3146	. . . . . . 7 ⊢ (((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) ∧ 𝑢 ∈ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋}))) → 𝑋 ∈ 𝑆)
144	123, 143	exlimddv 1937	. . . . . 6 ⊢ ((𝜑 ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → 𝑋 ∈ 𝑆)
145	144	adantlr 716	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → 𝑋 ∈ 𝑆)
146		simplr 769	. . . . 5 ⊢ (((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) ∧ ¬ (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅) → ¬ 𝑋 ∈ 𝑆)
147	145, 146	condan 818	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → (𝑆 ∩ ((RSpan‘𝑅)‘{𝑋})) = ∅)
148		eqid 2737	. . . 4 ⊢ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} = {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)}
149	6, 77, 83, 120, 15, 147, 148	ssdifidlprm 33533	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → ∃𝑖 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} (𝑖 ∈ (PrmIdeal‘𝑅) ∧ ∀𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ ((RSpan‘𝑅)‘{𝑋}) ⊆ 𝑝)} ¬ 𝑖 ⊊ 𝑗))
150	75, 149	r19.29a 3146	. 2 ⊢ ((𝜑 ∧ ¬ 𝑋 ∈ 𝑆) → ¬ 𝑃 ⊆ 𝑆)
151	25, 150	condan 818	1 ⊢ (𝜑 → 𝑋 ∈ 𝑆)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1087   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3390   ∖ cdif 3887   ∩ cin 3889   ⊆ wss 3890   ⊊ wpss 3891  ∅c0 4274  {csn 4568  ‘cfv 6492  (class class class)co 7360  Word cword 14466  ⟨“cs1 14549  Basecbs 17170  ._rcmulr 17212  0_gc0g 17393   Σ_g cgsu 17394  Mndcmnd 18693  SubMndcsubmnd 18741  mulGrpcmgp 20112  1_rcur 20153  Ringcrg 20205  CRingccrg 20206  Unitcui 20326  RPrimecrpm 20403  IDomncidom 20661  DivRingcdr 20697  LIdealclidl 21196  RSpancrsp 21197  PrmIdealcprmidl 33510  UFDcufd 33613

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-ac2 10376  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-se 5578  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-isom 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-rpss 7670  df-om 7811  df-1st 7935  df-2nd 7936  df-supp 8104  df-tpos 8169  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-oadd 8402  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-fin 8890  df-fsupp 9268  df-oi 9418  df-dju 9816  df-card 9854  df-ac 10029  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12166  df-2 12235  df-3 12236  df-4 12237  df-5 12238  df-6 12239  df-7 12240  df-8 12241  df-n0 12429  df-xnn0 12502  df-z 12516  df-uz 12780  df-fz 13453  df-fzo 13600  df-seq 13955  df-hash 14284  df-word 14467  df-lsw 14516  df-concat 14524  df-s1 14550  df-substr 14595  df-pfx 14625  df-sets 17125  df-slot 17143  df-ndx 17155  df-base 17171  df-ress 17192  df-plusg 17224  df-mulr 17225  df-sca 17227  df-vsca 17228  df-ip 17229  df-0g 17395  df-gsum 17396  df-mgm 18599  df-sgrp 18678  df-mnd 18694  df-submnd 18743  df-grp 18903  df-minusg 18904  df-sbg 18905  df-subg 19090  df-cntz 19283  df-lsm 19602  df-cmn 19748  df-abl 19749  df-mgp 20113  df-rng 20125  df-ur 20154  df-ring 20207  df-cring 20208  df-oppr 20308  df-dvdsr 20328  df-unit 20329  df-invr 20359  df-rprm 20404  df-nzr 20481  df-subrg 20538  df-domn 20663  df-idom 20664  df-lmod 20848  df-lss 20918  df-lsp 20958  df-sra 21160  df-rgmod 21161  df-lidl 21198  df-rsp 21199  df-prmidl 33511  df-ufd 33614

This theorem is referenced by:  1arithufd  33623