ssdifidllem - Mathbox for Thierry Arnoux

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

Theorem ssdifidllem 33463

Description: Lemma for ssdifidl 33464: The set 𝑃 used in the proof of ssdifidl 33464 satisfies the condition of Zorn's Lemma. (Contributed by Thierry Arnoux, 3-Jun-2025.)

**Hypotheses**
Ref	Expression
ssdifidl.1	⊢ 𝐵 = (Base‘𝑅)
ssdifidl.2	⊢ (𝜑 → 𝑅 ∈ Ring)
ssdifidl.3	⊢ (𝜑 → 𝐼 ∈ (LIdeal‘𝑅))
ssdifidl.4	⊢ (𝜑 → 𝑆 ⊆ 𝐵)
ssdifidl.5	⊢ (𝜑 → (𝑆 ∩ 𝐼) = ∅)
ssdifidl.6	⊢ 𝑃 = {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)}
ssdifidllem.7	⊢ (𝜑 → 𝑍 ⊆ 𝑃)
ssdifidllem.8	⊢ (𝜑 → 𝑍 ≠ ∅)
ssdifidllem.9	⊢ (𝜑 → [⊊] Or 𝑍)

**Assertion**
Ref	Expression
ssdifidllem	⊢ (𝜑 → ∪ 𝑍 ∈ 𝑃)

Distinct variable groups: 𝐼,𝑝 𝑅,𝑝 𝑆,𝑝 𝑍,𝑝 Allowed substitution hints: 𝜑(𝑝) 𝐵(𝑝) 𝑃(𝑝)

Proof of Theorem ssdifidllem Dummy variables 𝑎 𝑏 𝑖 𝑗 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ineq2 4221	. . . . 5 ⊢ (𝑝 = ∪ 𝑍 → (𝑆 ∩ 𝑝) = (𝑆 ∩ ∪ 𝑍))
2	1	eqeq1d 2736	. . . 4 ⊢ (𝑝 = ∪ 𝑍 → ((𝑆 ∩ 𝑝) = ∅ ↔ (𝑆 ∩ ∪ 𝑍) = ∅))
3		sseq2 4021	. . . 4 ⊢ (𝑝 = ∪ 𝑍 → (𝐼 ⊆ 𝑝 ↔ 𝐼 ⊆ ∪ 𝑍))
4	2, 3	anbi12d 632	. . 3 ⊢ (𝑝 = ∪ 𝑍 → (((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝) ↔ ((𝑆 ∩ ∪ 𝑍) = ∅ ∧ 𝐼 ⊆ ∪ 𝑍)))
5		ssdifidllem.7	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ⊆ 𝑃)
6		ssdifidl.6	. . . . . . . . . 10 ⊢ 𝑃 = {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)}
7	6	ssrab3 4091	. . . . . . . . 9 ⊢ 𝑃 ⊆ (LIdeal‘𝑅)
8	5, 7	sstrdi 4007	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ⊆ (LIdeal‘𝑅))
9	8	sselda 3994	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (LIdeal‘𝑅))
10		ssdifidl.1	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
11		eqid 2734	. . . . . . . 8 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
12	10, 11	lidlss 21239	. . . . . . 7 ⊢ (𝑗 ∈ (LIdeal‘𝑅) → 𝑗 ⊆ 𝐵)
13	9, 12	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ⊆ 𝐵)
14	13	ralrimiva 3143	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ 𝑍 𝑗 ⊆ 𝐵)
15		unissb 4943	. . . . 5 ⊢ (∪ 𝑍 ⊆ 𝐵 ↔ ∀𝑗 ∈ 𝑍 𝑗 ⊆ 𝐵)
16	14, 15	sylibr 234	. . . 4 ⊢ (𝜑 → ∪ 𝑍 ⊆ 𝐵)
17		ssdifidllem.8	. . . . . . 7 ⊢ (𝜑 → 𝑍 ≠ ∅)
18		ssdifidl.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Ring)
19		eqid 2734	. . . . . . . . . . 11 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
20	11, 19	lidl0cl 21247	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑗 ∈ (LIdeal‘𝑅)) → (0_g‘𝑅) ∈ 𝑗)
21	18, 9, 20	syl2an2r 685	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (0_g‘𝑅) ∈ 𝑗)
22		n0i 4345	. . . . . . . . 9 ⊢ ((0_g‘𝑅) ∈ 𝑗 → ¬ 𝑗 = ∅)
23	21, 22	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → ¬ 𝑗 = ∅)
24	23	reximdva0 4360	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑍 ≠ ∅) → ∃𝑗 ∈ 𝑍 ¬ 𝑗 = ∅)
25	17, 24	mpdan 687	. . . . . 6 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ¬ 𝑗 = ∅)
26		rexnal 3097	. . . . . 6 ⊢ (∃𝑗 ∈ 𝑍 ¬ 𝑗 = ∅ ↔ ¬ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
27	25, 26	sylib 218	. . . . 5 ⊢ (𝜑 → ¬ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
28		uni0c 4938	. . . . . 6 ⊢ (∪ 𝑍 = ∅ ↔ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
29	28	necon3abii 2984	. . . . 5 ⊢ (∪ 𝑍 ≠ ∅ ↔ ¬ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
30	27, 29	sylibr 234	. . . 4 ⊢ (𝜑 → ∪ 𝑍 ≠ ∅)
31		eluni2 4915	. . . . . . . 8 ⊢ (𝑎 ∈ ∪ 𝑍 ↔ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖)
32		eluni2 4915	. . . . . . . 8 ⊢ (𝑏 ∈ ∪ 𝑍 ↔ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗)
33	31, 32	anbi12i 628	. . . . . . 7 ⊢ ((𝑎 ∈ ∪ 𝑍 ∧ 𝑏 ∈ ∪ 𝑍) ↔ (∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖 ∧ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗))
34		an32 646	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ 𝑗 ∈ 𝑍) ↔ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖))
35	18	ad6antr 736	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑅 ∈ Ring)
36	8	ad6antr 736	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑍 ⊆ (LIdeal‘𝑅))
37		simp-5r 786	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑗 ∈ 𝑍)
38	36, 37	sseldd 3995	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑗 ∈ (LIdeal‘𝑅))
39		eqid 2734	. . . . . . . . . . . . . . . 16 ⊢ (._r‘𝑅) = (._r‘𝑅)
40		simp-6r 788	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑥 ∈ 𝐵)
41		simpr 484	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑖 ⊆ 𝑗)
42		simplr 769	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑎 ∈ 𝑖)
43	41, 42	sseldd 3995	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑎 ∈ 𝑗)
44	11, 10, 39, 35, 38, 40, 43	lidlmcld 33426	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → (𝑥(._r‘𝑅)𝑎) ∈ 𝑗)
45		simp-4r 784	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑏 ∈ 𝑗)
46		eqid 2734	. . . . . . . . . . . . . . . 16 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
47	11, 46	lidlacl 21248	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ Ring ∧ 𝑗 ∈ (LIdeal‘𝑅)) ∧ ((𝑥(._r‘𝑅)𝑎) ∈ 𝑗 ∧ 𝑏 ∈ 𝑗)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑗)
48	35, 38, 44, 45, 47	syl22anc 839	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑗)
49		elunii 4916	. . . . . . . . . . . . . 14 ⊢ ((((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑗 ∧ 𝑗 ∈ 𝑍) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
50	48, 37, 49	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
51	18	ad6antr 736	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑅 ∈ Ring)
52	8	ad6antr 736	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑍 ⊆ (LIdeal‘𝑅))
53		simpllr 776	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑖 ∈ 𝑍)
54	52, 53	sseldd 3995	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑖 ∈ (LIdeal‘𝑅))
55		simp-6r 788	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑥 ∈ 𝐵)
56		simplr 769	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑎 ∈ 𝑖)
57	11, 10, 39, 51, 54, 55, 56	lidlmcld 33426	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → (𝑥(._r‘𝑅)𝑎) ∈ 𝑖)
58		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑗 ⊆ 𝑖)
59		simp-4r 784	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑏 ∈ 𝑗)
60	58, 59	sseldd 3995	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑏 ∈ 𝑖)
61	11, 46	lidlacl 21248	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ Ring ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑥(._r‘𝑅)𝑎) ∈ 𝑖 ∧ 𝑏 ∈ 𝑖)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑖)
62	51, 54, 57, 60, 61	syl22anc 839	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑖)
63		elunii 4916	. . . . . . . . . . . . . 14 ⊢ ((((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑖 ∧ 𝑖 ∈ 𝑍) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
64	62, 53, 63	syl2anc 584	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
65		ssdifidllem.9	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → [⊊] Or 𝑍)
66	65	ad5antr 734	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → [⊊] Or 𝑍)
67		simplr 769	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → 𝑖 ∈ 𝑍)
68		simp-4r 784	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → 𝑗 ∈ 𝑍)
69		sorpssi 7747	. . . . . . . . . . . . . 14 ⊢ (( [⊊] Or 𝑍 ∧ (𝑖 ∈ 𝑍 ∧ 𝑗 ∈ 𝑍)) → (𝑖 ⊆ 𝑗 ∨ 𝑗 ⊆ 𝑖))
70	66, 67, 68, 69	syl12anc 837	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → (𝑖 ⊆ 𝑗 ∨ 𝑗 ⊆ 𝑖))
71	50, 64, 70	mpjaodan 960	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
72	71	r19.29an 3155	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
73	72	an32s 652	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ 𝑏 ∈ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
74	34, 73	sylanb 581	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
75	74	r19.29an 3155	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
76	75	anasss 466	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖 ∧ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
77	33, 76	sylan2b 594	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (𝑎 ∈ ∪ 𝑍 ∧ 𝑏 ∈ ∪ 𝑍)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
78	77	ralrimivva 3199	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∀𝑎 ∈ ∪ 𝑍∀𝑏 ∈ ∪ 𝑍((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
79	78	ralrimiva 3143	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ ∪ 𝑍∀𝑏 ∈ ∪ 𝑍((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
80	11, 10, 46, 39	islidl 21242	. . . 4 ⊢ (∪ 𝑍 ∈ (LIdeal‘𝑅) ↔ (∪ 𝑍 ⊆ 𝐵 ∧ ∪ 𝑍 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ ∪ 𝑍∀𝑏 ∈ ∪ 𝑍((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍))
81	16, 30, 79, 80	syl3anbrc 1342	. . 3 ⊢ (𝜑 → ∪ 𝑍 ∈ (LIdeal‘𝑅))
82		iunss1 5010	. . . . . . 7 ⊢ (𝑍 ⊆ 𝑃 → ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) ⊆ ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗))
83	5, 82	syl 17	. . . . . 6 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) ⊆ ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗))
84		uniin2 32572	. . . . . . 7 ⊢ ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) = (𝑆 ∩ ∪ 𝑍)
85	84	a1i 11	. . . . . 6 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) = (𝑆 ∩ ∪ 𝑍))
86	7	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ⊆ (LIdeal‘𝑅))
87	86	sselda 3994	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → 𝑗 ∈ (LIdeal‘𝑅))
88		simpr 484	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → 𝑗 ∈ 𝑃)
89	88, 6	eleqtrdi 2848	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → 𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)})
90		ineq2 4221	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑗 → (𝑆 ∩ 𝑝) = (𝑆 ∩ 𝑗))
91	90	eqeq1d 2736	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑗 → ((𝑆 ∩ 𝑝) = ∅ ↔ (𝑆 ∩ 𝑗) = ∅))
92		sseq2 4021	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑗 → (𝐼 ⊆ 𝑝 ↔ 𝐼 ⊆ 𝑗))
93	91, 92	anbi12d 632	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑗 → (((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝) ↔ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
94	93	elrab3 3695	. . . . . . . . . 10 ⊢ (𝑗 ∈ (LIdeal‘𝑅) → (𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)} ↔ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
95	94	simprbda 498	. . . . . . . . 9 ⊢ ((𝑗 ∈ (LIdeal‘𝑅) ∧ 𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)}) → (𝑆 ∩ 𝑗) = ∅)
96	87, 89, 95	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → (𝑆 ∩ 𝑗) = ∅)
97	96	iuneq2dv 5020	. . . . . . 7 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗) = ∪ 𝑗 ∈ 𝑃 ∅)
98		iun0 5066	. . . . . . 7 ⊢ ∪ 𝑗 ∈ 𝑃 ∅ = ∅
99	97, 98	eqtrdi 2790	. . . . . 6 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗) = ∅)
100	83, 85, 99	3sstr3d 4041	. . . . 5 ⊢ (𝜑 → (𝑆 ∩ ∪ 𝑍) ⊆ ∅)
101		ss0 4407	. . . . 5 ⊢ ((𝑆 ∩ ∪ 𝑍) ⊆ ∅ → (𝑆 ∩ ∪ 𝑍) = ∅)
102	100, 101	syl 17	. . . 4 ⊢ (𝜑 → (𝑆 ∩ ∪ 𝑍) = ∅)
103	5	sselda 3994	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑃)
104	93, 6	elrab2 3697	. . . . . . . . 9 ⊢ (𝑗 ∈ 𝑃 ↔ (𝑗 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
105	103, 104	sylib 218	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑗 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
106	105	simprrd 774	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐼 ⊆ 𝑗)
107	106	ralrimiva 3143	. . . . . 6 ⊢ (𝜑 → ∀𝑗 ∈ 𝑍 𝐼 ⊆ 𝑗)
108		ssint 4968	. . . . . 6 ⊢ (𝐼 ⊆ ∩ 𝑍 ↔ ∀𝑗 ∈ 𝑍 𝐼 ⊆ 𝑗)
109	107, 108	sylibr 234	. . . . 5 ⊢ (𝜑 → 𝐼 ⊆ ∩ 𝑍)
110		intssuni 4974	. . . . . 6 ⊢ (𝑍 ≠ ∅ → ∩ 𝑍 ⊆ ∪ 𝑍)
111	17, 110	syl 17	. . . . 5 ⊢ (𝜑 → ∩ 𝑍 ⊆ ∪ 𝑍)
112	109, 111	sstrd 4005	. . . 4 ⊢ (𝜑 → 𝐼 ⊆ ∪ 𝑍)
113	102, 112	jca 511	. . 3 ⊢ (𝜑 → ((𝑆 ∩ ∪ 𝑍) = ∅ ∧ 𝐼 ⊆ ∪ 𝑍))
114	4, 81, 113	elrabd 3696	. 2 ⊢ (𝜑 → ∪ 𝑍 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)})
115	114, 6	eleqtrrdi 2849	1 ⊢ (𝜑 → ∪ 𝑍 ∈ 𝑃)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1536 ∈ wcel 2105 ≠ wne 2937 ∀wral 3058 ∃wrex 3067 {crab 3432 ∩ cin 3961 ⊆ wss 3962 ∅c0 4338 ∪ cuni 4911 ∩ cint 4950 ∪ ciun 4995 Or wor 5595 ‘cfv 6562 (class class class)co 7430 [⊊] crpss 7740 Basecbs 17244 +_gcplusg 17297 ._rcmulr 17298 0_gc0g 17485 Ringcrg 20250 LIdealclidl 21233

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-rep 5284 ax-sep 5301 ax-nul 5311 ax-pow 5370 ax-pr 5437 ax-un 7753 ax-cnex 11208 ax-resscn 11209 ax-1cn 11210 ax-icn 11211 ax-addcl 11212 ax-addrcl 11213 ax-mulcl 11214 ax-mulrcl 11215 ax-mulcom 11216 ax-addass 11217 ax-mulass 11218 ax-distr 11219 ax-i2m1 11220 ax-1ne0 11221 ax-1rid 11222 ax-rnegex 11223 ax-rrecex 11224 ax-cnre 11225 ax-pre-lttri 11226 ax-pre-lttrn 11227 ax-pre-ltadd 11228 ax-pre-mulgt0 11229

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3377 df-reu 3378 df-rab 3433 df-v 3479 df-sbc 3791 df-csb 3908 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-pss 3982 df-nul 4339 df-if 4531 df-pw 4606 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-int 4951 df-iun 4997 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5582 df-eprel 5588 df-po 5596 df-so 5597 df-fr 5640 df-we 5642 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-res 5700 df-ima 5701 df-pred 6322 df-ord 6388 df-on 6389 df-lim 6390 df-suc 6391 df-iota 6515 df-fun 6564 df-fn 6565 df-f 6566 df-f1 6567 df-fo 6568 df-f1o 6569 df-fv 6570 df-riota 7387 df-ov 7433 df-oprab 7434 df-mpo 7435 df-rpss 7741 df-om 7887 df-1st 8012 df-2nd 8013 df-frecs 8304 df-wrecs 8335 df-recs 8409 df-rdg 8448 df-er 8743 df-en 8984 df-dom 8985 df-sdom 8986 df-pnf 11294 df-mnf 11295 df-xr 11296 df-ltxr 11297 df-le 11298 df-sub 11491 df-neg 11492 df-nn 12264 df-2 12326 df-3 12327 df-4 12328 df-5 12329 df-6 12330 df-7 12331 df-8 12332 df-sets 17197 df-slot 17215 df-ndx 17227 df-base 17245 df-ress 17274 df-plusg 17310 df-mulr 17311 df-sca 17313 df-vsca 17314 df-ip 17315 df-0g 17487 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-grp 18966 df-minusg 18967 df-sbg 18968 df-subg 19153 df-cmn 19814 df-abl 19815 df-mgp 20152 df-rng 20170 df-ur 20199 df-ring 20252 df-subrg 20586 df-lmod 20876 df-lss 20947 df-sra 21189 df-rgmod 21190 df-lidl 21235

This theorem is referenced by: ssdifidl 33464

W3C validator