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 33546

Description: Lemma for ssdifidl 33547: The set 𝑃 used in the proof of ssdifidl 33547 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 4150	. . . . 5 ⊢ (𝑝 = ∪ 𝑍 → (𝑆 ∩ 𝑝) = (𝑆 ∩ ∪ 𝑍))
2	1	eqeq1d 2742	. . . 4 ⊢ (𝑝 = ∪ 𝑍 → ((𝑆 ∩ 𝑝) = ∅ ↔ (𝑆 ∩ ∪ 𝑍) = ∅))
3		sseq2 3948	. . . 4 ⊢ (𝑝 = ∪ 𝑍 → (𝐼 ⊆ 𝑝 ↔ 𝐼 ⊆ ∪ 𝑍))
4	2, 3	anbi12d 638	. . 3 ⊢ (𝑝 = ∪ 𝑍 → (((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝) ↔ ((𝑆 ∩ ∪ 𝑍) = ∅ ∧ 𝐼 ⊆ ∪ 𝑍)))
5		ssdifidllem.7	. . . . . . . . 9 ⊢ (𝜑 → 𝑍 ⊆ 𝑃)
6		ssdifidl.6	. . . . . . . . . 10 ⊢ 𝑃 = {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)}
7	6	ssrab3 4020	. . . . . . . . 9 ⊢ 𝑃 ⊆ (LIdeal‘𝑅)
8	5, 7	sstrdi 3934	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ⊆ (LIdeal‘𝑅))
9	8	sselda 3922	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ (LIdeal‘𝑅))
10		ssdifidl.1	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
11		eqid 2740	. . . . . . . 8 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅)
12	10, 11	lidlss 21212	. . . . . . 7 ⊢ (𝑗 ∈ (LIdeal‘𝑅) → 𝑗 ⊆ 𝐵)
13	9, 12	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ⊆ 𝐵)
14	13	ralrimiva 3132	. . . . 5 ⊢ (𝜑 → ∀𝑗 ∈ 𝑍 𝑗 ⊆ 𝐵)
15		unissb 4878	. . . . 5 ⊢ (∪ 𝑍 ⊆ 𝐵 ↔ ∀𝑗 ∈ 𝑍 𝑗 ⊆ 𝐵)
16	14, 15	sylibr 235	. . . 4 ⊢ (𝜑 → ∪ 𝑍 ⊆ 𝐵)
17		ssdifidllem.8	. . . . . . 7 ⊢ (𝜑 → 𝑍 ≠ ∅)
18		ssdifidl.2	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ Ring)
19		eqid 2740	. . . . . . . . . . 11 ⊢ (0_g‘𝑅) = (0_g‘𝑅)
20	11, 19	lidl0cl 21220	. . . . . . . . . 10 ⊢ ((𝑅 ∈ Ring ∧ 𝑗 ∈ (LIdeal‘𝑅)) → (0_g‘𝑅) ∈ 𝑗)
21	18, 9, 20	syl2an2r 691	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (0_g‘𝑅) ∈ 𝑗)
22		n0i 4275	. . . . . . . . 9 ⊢ ((0_g‘𝑅) ∈ 𝑗 → ¬ 𝑗 = ∅)
23	21, 22	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → ¬ 𝑗 = ∅)
24	23	reximdva0 4290	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑍 ≠ ∅) → ∃𝑗 ∈ 𝑍 ¬ 𝑗 = ∅)
25	17, 24	mpdan 693	. . . . . 6 ⊢ (𝜑 → ∃𝑗 ∈ 𝑍 ¬ 𝑗 = ∅)
26		rexnal 3092	. . . . . 6 ⊢ (∃𝑗 ∈ 𝑍 ¬ 𝑗 = ∅ ↔ ¬ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
27	25, 26	sylib 219	. . . . 5 ⊢ (𝜑 → ¬ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
28		uni0c 4872	. . . . . 6 ⊢ (∪ 𝑍 = ∅ ↔ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
29	28	necon3abii 2981	. . . . 5 ⊢ (∪ 𝑍 ≠ ∅ ↔ ¬ ∀𝑗 ∈ 𝑍 𝑗 = ∅)
30	27, 29	sylibr 235	. . . 4 ⊢ (𝜑 → ∪ 𝑍 ≠ ∅)
31		eluni2 4849	. . . . . . . 8 ⊢ (𝑎 ∈ ∪ 𝑍 ↔ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖)
32		eluni2 4849	. . . . . . . 8 ⊢ (𝑏 ∈ ∪ 𝑍 ↔ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗)
33	31, 32	anbi12i 634	. . . . . . 7 ⊢ ((𝑎 ∈ ∪ 𝑍 ∧ 𝑏 ∈ ∪ 𝑍) ↔ (∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖 ∧ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗))
34		an32 652	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ 𝑗 ∈ 𝑍) ↔ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖))
35	18	ad6antr 742	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑅 ∈ Ring)
36	8	ad6antr 742	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑍 ⊆ (LIdeal‘𝑅))
37		simp-5r 791	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑗 ∈ 𝑍)
38	36, 37	sseldd 3923	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑗 ∈ (LIdeal‘𝑅))
39		eqid 2740	. . . . . . . . . . . . . . . 16 ⊢ (._r‘𝑅) = (._r‘𝑅)
40		simp-6r 793	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑥 ∈ 𝐵)
41		simpr 485	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑖 ⊆ 𝑗)
42		simplr 774	. . . . . . . . . . . . . . . . 17 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑎 ∈ 𝑖)
43	41, 42	sseldd 3923	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑎 ∈ 𝑗)
44	11, 10, 39, 35, 38, 40, 43	lidlmcld 33509	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → (𝑥(._r‘𝑅)𝑎) ∈ 𝑗)
45		simp-4r 789	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → 𝑏 ∈ 𝑗)
46		eqid 2740	. . . . . . . . . . . . . . . 16 ⊢ (+_g‘𝑅) = (+_g‘𝑅)
47	11, 46	lidlacl 21221	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ Ring ∧ 𝑗 ∈ (LIdeal‘𝑅)) ∧ ((𝑥(._r‘𝑅)𝑎) ∈ 𝑗 ∧ 𝑏 ∈ 𝑗)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑗)
48	35, 38, 44, 45, 47	syl22anc 844	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑗)
49		elunii 4850	. . . . . . . . . . . . . 14 ⊢ ((((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑗 ∧ 𝑗 ∈ 𝑍) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
50	48, 37, 49	syl2anc 590	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑖 ⊆ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
51	18	ad6antr 742	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑅 ∈ Ring)
52	8	ad6antr 742	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑍 ⊆ (LIdeal‘𝑅))
53		simpllr 781	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑖 ∈ 𝑍)
54	52, 53	sseldd 3923	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑖 ∈ (LIdeal‘𝑅))
55		simp-6r 793	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑥 ∈ 𝐵)
56		simplr 774	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑎 ∈ 𝑖)
57	11, 10, 39, 51, 54, 55, 56	lidlmcld 33509	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → (𝑥(._r‘𝑅)𝑎) ∈ 𝑖)
58		simpr 485	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑗 ⊆ 𝑖)
59		simp-4r 789	. . . . . . . . . . . . . . . 16 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑏 ∈ 𝑗)
60	58, 59	sseldd 3923	. . . . . . . . . . . . . . 15 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → 𝑏 ∈ 𝑖)
61	11, 46	lidlacl 21221	. . . . . . . . . . . . . . 15 ⊢ (((𝑅 ∈ Ring ∧ 𝑖 ∈ (LIdeal‘𝑅)) ∧ ((𝑥(._r‘𝑅)𝑎) ∈ 𝑖 ∧ 𝑏 ∈ 𝑖)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑖)
62	51, 54, 57, 60, 61	syl22anc 844	. . . . . . . . . . . . . 14 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑖)
63		elunii 4850	. . . . . . . . . . . . . 14 ⊢ ((((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ 𝑖 ∧ 𝑖 ∈ 𝑍) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
64	62, 53, 63	syl2anc 590	. . . . . . . . . . . . 13 ⊢ (((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) ∧ 𝑗 ⊆ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
65		ssdifidllem.9	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → [⊊] Or 𝑍)
66	65	ad5antr 740	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → [⊊] Or 𝑍)
67		simplr 774	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → 𝑖 ∈ 𝑍)
68		simp-4r 789	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → 𝑗 ∈ 𝑍)
69		sorpssi 7679	. . . . . . . . . . . . . 14 ⊢ (( [⊊] Or 𝑍 ∧ (𝑖 ∈ 𝑍 ∧ 𝑗 ∈ 𝑍)) → (𝑖 ⊆ 𝑗 ∨ 𝑗 ⊆ 𝑖))
70	66, 67, 68, 69	syl12anc 842	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → (𝑖 ⊆ 𝑗 ∨ 𝑗 ⊆ 𝑖))
71	50, 64, 70	mpjaodan 966	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ 𝑖 ∈ 𝑍) ∧ 𝑎 ∈ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
72	71	r19.29an 3144	. . . . . . . . . . 11 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
73	72	an32s 658	. . . . . . . . . 10 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ 𝑗 ∈ 𝑍) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ 𝑏 ∈ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
74	34, 73	sylanb 587	. . . . . . . . 9 ⊢ (((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ 𝑗 ∈ 𝑍) ∧ 𝑏 ∈ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
75	74	r19.29an 3144	. . . . . . . 8 ⊢ ((((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ ∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖) ∧ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
76	75	anasss 467	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (∃𝑖 ∈ 𝑍 𝑎 ∈ 𝑖 ∧ ∃𝑗 ∈ 𝑍 𝑏 ∈ 𝑗)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
77	33, 76	sylan2b 600	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝐵) ∧ (𝑎 ∈ ∪ 𝑍 ∧ 𝑏 ∈ ∪ 𝑍)) → ((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
78	77	ralrimivva 3183	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ∀𝑎 ∈ ∪ 𝑍∀𝑏 ∈ ∪ 𝑍((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
79	78	ralrimiva 3132	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ ∪ 𝑍∀𝑏 ∈ ∪ 𝑍((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍)
80	11, 10, 46, 39	islidl 21215	. . . 4 ⊢ (∪ 𝑍 ∈ (LIdeal‘𝑅) ↔ (∪ 𝑍 ⊆ 𝐵 ∧ ∪ 𝑍 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑎 ∈ ∪ 𝑍∀𝑏 ∈ ∪ 𝑍((𝑥(._r‘𝑅)𝑎)(+_g‘𝑅)𝑏) ∈ ∪ 𝑍))
81	16, 30, 79, 80	syl3anbrc 1350	. . 3 ⊢ (𝜑 → ∪ 𝑍 ∈ (LIdeal‘𝑅))
82		iunss1 4943	. . . . . . 7 ⊢ (𝑍 ⊆ 𝑃 → ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) ⊆ ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗))
83	5, 82	syl 17	. . . . . 6 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) ⊆ ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗))
84		uniin2 32648	. . . . . . 7 ⊢ ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) = (𝑆 ∩ ∪ 𝑍)
85	84	a1i 11	. . . . . 6 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑍 (𝑆 ∩ 𝑗) = (𝑆 ∩ ∪ 𝑍))
86	7	a1i 11	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ⊆ (LIdeal‘𝑅))
87	86	sselda 3922	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → 𝑗 ∈ (LIdeal‘𝑅))
88		simpr 485	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → 𝑗 ∈ 𝑃)
89	88, 6	eleqtrdi 2850	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → 𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)})
90		ineq2 4150	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑗 → (𝑆 ∩ 𝑝) = (𝑆 ∩ 𝑗))
91	90	eqeq1d 2742	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑗 → ((𝑆 ∩ 𝑝) = ∅ ↔ (𝑆 ∩ 𝑗) = ∅))
92		sseq2 3948	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑗 → (𝐼 ⊆ 𝑝 ↔ 𝐼 ⊆ 𝑗))
93	91, 92	anbi12d 638	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑗 → (((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝) ↔ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
94	93	elrab3 3637	. . . . . . . . . 10 ⊢ (𝑗 ∈ (LIdeal‘𝑅) → (𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)} ↔ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
95	94	simprbda 499	. . . . . . . . 9 ⊢ ((𝑗 ∈ (LIdeal‘𝑅) ∧ 𝑗 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)}) → (𝑆 ∩ 𝑗) = ∅)
96	87, 89, 95	syl2anc 590	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑃) → (𝑆 ∩ 𝑗) = ∅)
97	96	iuneq2dv 4953	. . . . . . 7 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗) = ∪ 𝑗 ∈ 𝑃 ∅)
98		iun0 4998	. . . . . . 7 ⊢ ∪ 𝑗 ∈ 𝑃 ∅ = ∅
99	97, 98	eqtrdi 2791	. . . . . 6 ⊢ (𝜑 → ∪ 𝑗 ∈ 𝑃 (𝑆 ∩ 𝑗) = ∅)
100	83, 85, 99	3sstr3d 3976	. . . . 5 ⊢ (𝜑 → (𝑆 ∩ ∪ 𝑍) ⊆ ∅)
101		ss0 4337	. . . . 5 ⊢ ((𝑆 ∩ ∪ 𝑍) ⊆ ∅ → (𝑆 ∩ ∪ 𝑍) = ∅)
102	100, 101	syl 17	. . . 4 ⊢ (𝜑 → (𝑆 ∩ ∪ 𝑍) = ∅)
103	5	sselda 3922	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝑗 ∈ 𝑃)
104	93, 6	elrab2 3639	. . . . . . . . 9 ⊢ (𝑗 ∈ 𝑃 ↔ (𝑗 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
105	103, 104	sylib 219	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → (𝑗 ∈ (LIdeal‘𝑅) ∧ ((𝑆 ∩ 𝑗) = ∅ ∧ 𝐼 ⊆ 𝑗)))
106	105	simprrd 779	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑗 ∈ 𝑍) → 𝐼 ⊆ 𝑗)
107	106	ralrimiva 3132	. . . . . 6 ⊢ (𝜑 → ∀𝑗 ∈ 𝑍 𝐼 ⊆ 𝑗)
108		ssint 4901	. . . . . 6 ⊢ (𝐼 ⊆ ∩ 𝑍 ↔ ∀𝑗 ∈ 𝑍 𝐼 ⊆ 𝑗)
109	107, 108	sylibr 235	. . . . 5 ⊢ (𝜑 → 𝐼 ⊆ ∩ 𝑍)
110		intssuni 4907	. . . . . 6 ⊢ (𝑍 ≠ ∅ → ∩ 𝑍 ⊆ ∪ 𝑍)
111	17, 110	syl 17	. . . . 5 ⊢ (𝜑 → ∩ 𝑍 ⊆ ∪ 𝑍)
112	109, 111	sstrd 3932	. . . 4 ⊢ (𝜑 → 𝐼 ⊆ ∪ 𝑍)
113	102, 112	jca 516	. . 3 ⊢ (𝜑 → ((𝑆 ∩ ∪ 𝑍) = ∅ ∧ 𝐼 ⊆ ∪ 𝑍))
114	4, 81, 113	elrabd 3638	. 2 ⊢ (𝜑 → ∪ 𝑍 ∈ {𝑝 ∈ (LIdeal‘𝑅) ∣ ((𝑆 ∩ 𝑝) = ∅ ∧ 𝐼 ⊆ 𝑝)})
115	114, 6	eleqtrrdi 2851	1 ⊢ (𝜑 → ∪ 𝑍 ∈ 𝑃)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∨ wo 853 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 ∀wral 3054 ∃wrex 3064 {crab 3392 ∩ cin 3889 ⊆ wss 3890 ∅c0 4268 ∪ cuni 4845 ∩ cint 4884 ∪ ciun 4928 Or wor 5532 ‘cfv 6492 (class class class)co 7363 [⊊] crpss 7672 Basecbs 17177 +_gcplusg 17218 ._rcmulr 17219 0_gc0g 17400 Ringcrg 20212 LIdealclidl 21206

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 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-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-rpss 7673 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-nn 12173 df-2 12242 df-3 12243 df-4 12244 df-5 12245 df-6 12246 df-7 12247 df-8 12248 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-mulr 17232 df-sca 17234 df-vsca 17235 df-ip 17236 df-0g 17402 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-grp 18910 df-minusg 18911 df-sbg 18912 df-subg 19097 df-cmn 19755 df-abl 19756 df-mgp 20120 df-rng 20132 df-ur 20161 df-ring 20214 df-subrg 20549 df-lmod 20859 df-lss 20929 df-sra 21170 df-rgmod 21171 df-lidl 21208

This theorem is referenced by: ssdifidl 33547

W3C validator