zsupssdc - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > zsupssdc		GIF version

Theorem zsupssdc 10622

Description: An inhabited decidable bounded subset of integers has a supremum in the set. (The proof does not use ax-pre-suploc 8264.) (Contributed by Mario Carneiro, 21-Apr-2015.) (Revised by Jim Kingdon, 5-Oct-2024.)

**Hypotheses**
Ref	Expression
zsupssdc.a	⊢ (𝜑 → 𝐴 ⊆ ℤ)
zsupssdc.m	⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
zsupssdc.dc	⊢ (𝜑 → ∀𝑥 ∈ ℤ DECID 𝑥 ∈ 𝐴)
zsupssdc.ub	⊢ (𝜑 → ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)

**Assertion**
Ref	Expression
zsupssdc	⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))

Distinct variable groups: 𝑥,𝐴,𝑦,𝑧 𝑥,𝐵 𝜑,𝑦 Allowed substitution hints: 𝜑(𝑥,𝑧) 𝐵(𝑦,𝑧)

Proof of Theorem zsupssdc Dummy variables 𝑎 𝑚 𝑛 𝑤 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		zsupssdc.ub	. . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥)
2		breq1 4117	. . . . . 6 ⊢ (𝑦 = 𝑚 → (𝑦 ≤ 𝑥 ↔ 𝑚 ≤ 𝑥))
3	2	cbvralvw 2784	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑥)
4		breq2 4118	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑚 ≤ 𝑥 ↔ 𝑚 ≤ 𝑛))
5	4	ralbidv 2544	. . . . 5 ⊢ (𝑥 = 𝑛 → (∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛))
6	3, 5	bitrid 192	. . . 4 ⊢ (𝑥 = 𝑛 → (∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛))
7	6	cbvrexvw 2785	. . 3 ⊢ (∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∃𝑛 ∈ ℤ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
8	1, 7	sylib 122	. 2 ⊢ (𝜑 → ∃𝑛 ∈ ℤ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
9		zsupssdc.m	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
10		eleq1w 2295	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (𝑥 ∈ 𝐴 ↔ 𝑎 ∈ 𝐴))
11	10	cbvexv 1970	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ∃𝑎 𝑎 ∈ 𝐴)
12	9, 11	sylib 122	. . . . . 6 ⊢ (𝜑 → ∃𝑎 𝑎 ∈ 𝐴)
13	12	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∃𝑎 𝑎 ∈ 𝐴)
14		uzssz 9892	. . . . . . 7 ⊢ (ℤ_≥‘-𝑛) ⊆ ℤ
15		rabss2 3325	. . . . . . 7 ⊢ ((ℤ_≥‘-𝑛) ⊆ ℤ → {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
16	14, 15	ax-mp 5	. . . . . 6 ⊢ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}
17		negeq 8482	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑤 → -𝑏 = -𝑤)
18	17	eleq1d 2303	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑤 → (-𝑏 ∈ 𝐴 ↔ -𝑤 ∈ 𝐴))
19		simp1rl 1089	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑛 ∈ ℤ)
20	19	znegcld 9720	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑛 ∈ ℤ)
21		simp2 1025	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℤ)
22	21	zred 9718	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℝ)
23	19	zred 9718	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑛 ∈ ℝ)
24		breq1 4117	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = -𝑤 → (𝑚 ≤ 𝑛 ↔ -𝑤 ≤ 𝑛))
25		simp1rr 1090	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
26		simp3 1026	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑤 ∈ 𝐴)
27	24, 25, 26	rspcdva 2928	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑤 ≤ 𝑛)
28	22, 23, 27	lenegcon1d 8818	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑛 ≤ 𝑤)
29		eluz2 9877	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ (ℤ_≥‘-𝑛) ↔ (-𝑛 ∈ ℤ ∧ 𝑤 ∈ ℤ ∧ -𝑛 ≤ 𝑤))
30	20, 21, 28, 29	syl3anbrc 1208	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ (ℤ_≥‘-𝑛))
31	18, 30, 26	elrabd 2978	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ {𝑏 ∈ (ℤ_≥‘-𝑛) ∣ -𝑏 ∈ 𝐴})
32	31	rabssdv 3322	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ {𝑏 ∈ (ℤ_≥‘-𝑛) ∣ -𝑏 ∈ 𝐴})
33	18	cbvrabv 2814	. . . . . . . . . . 11 ⊢ {𝑏 ∈ (ℤ_≥‘-𝑛) ∣ -𝑏 ∈ 𝐴} = {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}
34	32, 33	sseqtrdi 3290	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
35	16	a1i 9	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
36	34, 35	eqssd 3259	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} = {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
37	36	infeq1d 7316	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) = inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
38	37	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) = inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
39		simprl 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → 𝑛 ∈ ℤ)
40	39	znegcld 9720	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → -𝑛 ∈ ℤ)
41	40	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑛 ∈ ℤ)
42		eqid 2234	. . . . . . . 8 ⊢ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} = {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}
43		negeq 8482	. . . . . . . . . 10 ⊢ (𝑤 = -𝑎 → -𝑤 = --𝑎)
44	43	eleq1d 2303	. . . . . . . . 9 ⊢ (𝑤 = -𝑎 → (-𝑤 ∈ 𝐴 ↔ --𝑎 ∈ 𝐴))
45		zsupssdc.a	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ⊆ ℤ)
46	45	ad2antrr 488	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝐴 ⊆ ℤ)
47		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
48	46, 47	sseldd 3243	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℤ)
49	48	znegcld 9720	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑎 ∈ ℤ)
50		breq1 4117	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑎 → (𝑚 ≤ 𝑛 ↔ 𝑎 ≤ 𝑛))
51		simplrr 538	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
52	50, 51, 47	rspcdva 2928	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ≤ 𝑛)
53	48	zred 9718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℝ)
54	39	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑛 ∈ ℤ)
55	54	zred 9718	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑛 ∈ ℝ)
56	53, 55	lenegd 8815	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → (𝑎 ≤ 𝑛 ↔ -𝑛 ≤ -𝑎))
57	52, 56	mpbid 147	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑛 ≤ -𝑎)
58		eluz2 9877	. . . . . . . . . 10 ⊢ (-𝑎 ∈ (ℤ_≥‘-𝑛) ↔ (-𝑛 ∈ ℤ ∧ -𝑎 ∈ ℤ ∧ -𝑛 ≤ -𝑎))
59	41, 49, 57, 58	syl3anbrc 1208	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑎 ∈ (ℤ_≥‘-𝑛))
60	48	zcnd 9719	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℂ)
61	60	negnegd 8591	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → --𝑎 = 𝑎)
62	61, 47	eqeltrd 2311	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → --𝑎 ∈ 𝐴)
63	44, 59, 62	elrabd 2978	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑎 ∈ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
64		eleq1 2297	. . . . . . . . . . 11 ⊢ (𝑥 = -𝑤 → (𝑥 ∈ 𝐴 ↔ -𝑤 ∈ 𝐴))
65	64	dcbid 846	. . . . . . . . . 10 ⊢ (𝑥 = -𝑤 → (DECID 𝑥 ∈ 𝐴 ↔ DECID -𝑤 ∈ 𝐴))
66		zsupssdc.dc	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ ℤ DECID 𝑥 ∈ 𝐴)
67	66	ad2antrr 488	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → ∀𝑥 ∈ ℤ DECID 𝑥 ∈ 𝐴)
68		elfzelz 10378	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ (-𝑛...-𝑎) → 𝑤 ∈ ℤ)
69	68	adantl 277	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → 𝑤 ∈ ℤ)
70	69	znegcld 9720	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → -𝑤 ∈ ℤ)
71	65, 67, 70	rspcdva 2928	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → DECID -𝑤 ∈ 𝐴)
72	71	adantlr 477	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → DECID -𝑤 ∈ 𝐴)
73	41, 42, 63, 72	infssuzcldc 10617	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
74	38, 73	eqeltrd 2311	. . . . . 6 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
75	16, 74	sselid 3240	. . . . 5 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
76	13, 75	exlimddv 1950	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
77		negeq 8482	. . . . . . 7 ⊢ (𝑛 = inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → -𝑛 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
78	77	eleq1d 2303	. . . . . 6 ⊢ (𝑛 = inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (-𝑛 ∈ 𝐴 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴))
79		negeq 8482	. . . . . . . 8 ⊢ (𝑤 = 𝑛 → -𝑤 = -𝑛)
80	79	eleq1d 2303	. . . . . . 7 ⊢ (𝑤 = 𝑛 → (-𝑤 ∈ 𝐴 ↔ -𝑛 ∈ 𝐴))
81	80	cbvrabv 2814	. . . . . 6 ⊢ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} = {𝑛 ∈ ℤ ∣ -𝑛 ∈ 𝐴}
82	78, 81	elrab2 2979	. . . . 5 ⊢ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ↔ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ ∧ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴))
83	82	simprbi 275	. . . 4 ⊢ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴)
84	76, 83	syl 14	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴)
85		ssrab2 3327	. . . . . . . . 9 ⊢ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ ℤ
86	85, 75	sselid 3240	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ)
87	86	zred 9718	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℝ)
88	87	renegcld 8670	. . . . . 6 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℝ)
89	41, 42, 63, 72	infssuzledc 10616	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ≤ -𝑎)
90	38, 89	eqbrtrd 4136	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ≤ -𝑎)
91	87, 53, 90	lenegcon2d 8819	. . . . . 6 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ≤ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
92	53, 88, 91	lensymd 8411	. . . . 5 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎)
93	92	ralrimiva 2617	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑎 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎)
94		breq2 4118	. . . . . 6 ⊢ (𝑎 = 𝑦 → (-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
95	94	notbid 673	. . . . 5 ⊢ (𝑎 = 𝑦 → (¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎 ↔ ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
96	95	cbvralv 2780	. . . 4 ⊢ (∀𝑎 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎 ↔ ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦)
97	93, 96	sylib 122	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦)
98		breq2 4118	. . . . . . 7 ⊢ (𝑧 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑦 < 𝑧 ↔ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )))
99	98	rspcev 2923	. . . . . 6 ⊢ ((-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 ∧ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)
100	99	ex 115	. . . . 5 ⊢ (-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 → (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
101	84, 100	syl 14	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
102	101	ralrimivw 2618	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
103		breq1 4117	. . . . . . 7 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑥 < 𝑦 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
104	103	notbid 673	. . . . . 6 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (¬ 𝑥 < 𝑦 ↔ ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
105	104	ralbidv 2544	. . . . 5 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
106		breq2 4118	. . . . . . 7 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑦 < 𝑥 ↔ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )))
107	106	imbi1d 231	. . . . . 6 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ((𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
108	107	ralbidv 2544	. . . . 5 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
109	105, 108	anbi12d 473	. . . 4 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ((∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)) ↔ (∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))))
110	109	rspcev 2923	. . 3 ⊢ ((-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
111	84, 97, 102, 110	syl12anc 1272	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
112	8, 111	rexlimddv 2667	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 DECID wdc 842 ∧ w3a 1005 = wceq 1398 ∃wex 1541 ∈ wcel 2205 ∀wral 2522 ∃wrex 2523 {crab 2526 ⊆ wss 3214 class class class wbr 4114 ‘cfv 5357 (class class class)co 6058 infcinf 7287 ℝcr 8142 < clt 8324 ≤ cle 8325 -cneg 8461 ℤcz 9594 ℤ_≥cuz 9871 ...cfz 10361

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-sep 4233 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-distr 8247 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-cnre 8254 ax-pre-ltirr 8255 ax-pre-ltwlin 8256 ax-pre-lttrn 8257 ax-pre-apti 8258 ax-pre-ltadd 8259

This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-po 4422 df-iso 4423 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-isom 5366 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-sup 7288 df-inf 7289 df-pnf 8326 df-mnf 8327 df-xr 8328 df-ltxr 8329 df-le 8330 df-sub 8462 df-neg 8463 df-inn 9255 df-n0 9514 df-z 9595 df-uz 9872 df-fz 10362 df-fzo 10499

This theorem is referenced by: suprzcl2dc 10623

W3C validator