zsupssdc - Intuitionistic Logic Explorer

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

Theorem zsupssdc 10651

Description: An inhabited decidable bounded subset of integers has a supremum in the set. (The proof does not use ax-pre-suploc 8290.) (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 4128	. . . . . 6 ⊢ (𝑦 = 𝑚 → (𝑦 ≤ 𝑥 ↔ 𝑚 ≤ 𝑥))
3	2	cbvralvw 2790	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑥)
4		breq2 4129	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑚 ≤ 𝑥 ↔ 𝑚 ≤ 𝑛))
5	4	ralbidv 2550	. . . . 5 ⊢ (𝑥 = 𝑛 → (∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛))
6	3, 5	bitrid 192	. . . 4 ⊢ (𝑥 = 𝑛 → (∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛))
7	6	cbvrexvw 2791	. . 3 ⊢ (∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∃𝑛 ∈ ℤ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
8	1, 7	sylib 122	. 2 ⊢ (𝜑 → ∃𝑛 ∈ ℤ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
9		zsupssdc.m	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
10		eleq1w 2299	. . . . . . . 8 ⊢ (𝑥 = 𝑎 → (𝑥 ∈ 𝐴 ↔ 𝑎 ∈ 𝐴))
11	10	cbvexv 1974	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ∃𝑎 𝑎 ∈ 𝐴)
12	9, 11	sylib 122	. . . . . 6 ⊢ (𝜑 → ∃𝑎 𝑎 ∈ 𝐴)
13	12	adantr 276	. . . . 5 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∃𝑎 𝑎 ∈ 𝐴)
14		uzssz 9921	. . . . . . 7 ⊢ (ℤ_≥‘-𝑛) ⊆ ℤ
15		rabss2 3331	. . . . . . 7 ⊢ ((ℤ_≥‘-𝑛) ⊆ ℤ → {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
16	14, 15	ax-mp 5	. . . . . 6 ⊢ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}
17		negeq 8509	. . . . . . . . . . . . . 14 ⊢ (𝑏 = 𝑤 → -𝑏 = -𝑤)
18	17	eleq1d 2307	. . . . . . . . . . . . 13 ⊢ (𝑏 = 𝑤 → (-𝑏 ∈ 𝐴 ↔ -𝑤 ∈ 𝐴))
19		simp1rl 1093	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑛 ∈ ℤ)
20	19	znegcld 9749	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑛 ∈ ℤ)
21		simp2 1029	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℤ)
22	21	zred 9747	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℝ)
23	19	zred 9747	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑛 ∈ ℝ)
24		breq1 4128	. . . . . . . . . . . . . . . 16 ⊢ (𝑚 = -𝑤 → (𝑚 ≤ 𝑛 ↔ -𝑤 ≤ 𝑛))
25		simp1rr 1094	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
26		simp3 1030	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑤 ∈ 𝐴)
27	24, 25, 26	rspcdva 2934	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑤 ≤ 𝑛)
28	22, 23, 27	lenegcon1d 8845	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑛 ≤ 𝑤)
29		eluz2 9906	. . . . . . . . . . . . . 14 ⊢ (𝑤 ∈ (ℤ_≥‘-𝑛) ↔ (-𝑛 ∈ ℤ ∧ 𝑤 ∈ ℤ ∧ -𝑛 ≤ 𝑤))
30	20, 21, 28, 29	syl3anbrc 1212	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ (ℤ_≥‘-𝑛))
31	18, 30, 26	elrabd 2984	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ {𝑏 ∈ (ℤ_≥‘-𝑛) ∣ -𝑏 ∈ 𝐴})
32	31	rabssdv 3328	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ {𝑏 ∈ (ℤ_≥‘-𝑛) ∣ -𝑏 ∈ 𝐴})
33	18	cbvrabv 2820	. . . . . . . . . . 11 ⊢ {𝑏 ∈ (ℤ_≥‘-𝑛) ∣ -𝑏 ∈ 𝐴} = {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}
34	32, 33	sseqtrdi 3296	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
35	16	a1i 9	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} ⊆ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
36	34, 35	eqssd 3265	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} = {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
37	36	infeq1d 7342	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) = inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
38	37	adantr 276	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) = inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
39		simprl 535	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → 𝑛 ∈ ℤ)
40	39	znegcld 9749	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → -𝑛 ∈ ℤ)
41	40	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑛 ∈ ℤ)
42		eqid 2238	. . . . . . . 8 ⊢ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴} = {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}
43		negeq 8509	. . . . . . . . . 10 ⊢ (𝑤 = -𝑎 → -𝑤 = --𝑎)
44	43	eleq1d 2307	. . . . . . . . 9 ⊢ (𝑤 = -𝑎 → (-𝑤 ∈ 𝐴 ↔ --𝑎 ∈ 𝐴))
45		zsupssdc.a	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐴 ⊆ ℤ)
46	45	ad2antrr 492	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝐴 ⊆ ℤ)
47		simpr 110	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
48	46, 47	sseldd 3249	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℤ)
49	48	znegcld 9749	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑎 ∈ ℤ)
50		breq1 4128	. . . . . . . . . . . 12 ⊢ (𝑚 = 𝑎 → (𝑚 ≤ 𝑛 ↔ 𝑎 ≤ 𝑛))
51		simplrr 542	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
52	50, 51, 47	rspcdva 2934	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ≤ 𝑛)
53	48	zred 9747	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℝ)
54	39	adantr 276	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑛 ∈ ℤ)
55	54	zred 9747	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑛 ∈ ℝ)
56	53, 55	lenegd 8842	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → (𝑎 ≤ 𝑛 ↔ -𝑛 ≤ -𝑎))
57	52, 56	mpbid 147	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑛 ≤ -𝑎)
58		eluz2 9906	. . . . . . . . . 10 ⊢ (-𝑎 ∈ (ℤ_≥‘-𝑛) ↔ (-𝑛 ∈ ℤ ∧ -𝑎 ∈ ℤ ∧ -𝑛 ≤ -𝑎))
59	41, 49, 57, 58	syl3anbrc 1212	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑎 ∈ (ℤ_≥‘-𝑛))
60	48	zcnd 9748	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ ℂ)
61	60	negnegd 8618	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → --𝑎 = 𝑎)
62	61, 47	eqeltrd 2315	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → --𝑎 ∈ 𝐴)
63	44, 59, 62	elrabd 2984	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -𝑎 ∈ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
64		eleq1 2301	. . . . . . . . . . 11 ⊢ (𝑥 = -𝑤 → (𝑥 ∈ 𝐴 ↔ -𝑤 ∈ 𝐴))
65	64	dcbid 850	. . . . . . . . . 10 ⊢ (𝑥 = -𝑤 → (DECID 𝑥 ∈ 𝐴 ↔ DECID -𝑤 ∈ 𝐴))
66		zsupssdc.dc	. . . . . . . . . . 11 ⊢ (𝜑 → ∀𝑥 ∈ ℤ DECID 𝑥 ∈ 𝐴)
67	66	ad2antrr 492	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → ∀𝑥 ∈ ℤ DECID 𝑥 ∈ 𝐴)
68		elfzelz 10407	. . . . . . . . . . . 12 ⊢ (𝑤 ∈ (-𝑛...-𝑎) → 𝑤 ∈ ℤ)
69	68	adantl 277	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → 𝑤 ∈ ℤ)
70	69	znegcld 9749	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → -𝑤 ∈ ℤ)
71	65, 67, 70	rspcdva 2934	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → DECID -𝑤 ∈ 𝐴)
72	71	adantlr 481	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) ∧ 𝑤 ∈ (-𝑛...-𝑎)) → DECID -𝑤 ∈ 𝐴)
73	41, 42, 63, 72	infssuzcldc 10646	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
74	38, 73	eqeltrd 2315	. . . . . 6 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴})
75	16, 74	sselid 3246	. . . . 5 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
76	13, 75	exlimddv 1954	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
77		negeq 8509	. . . . . . 7 ⊢ (𝑛 = inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → -𝑛 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
78	77	eleq1d 2307	. . . . . 6 ⊢ (𝑛 = inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (-𝑛 ∈ 𝐴 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴))
79		negeq 8509	. . . . . . . 8 ⊢ (𝑤 = 𝑛 → -𝑤 = -𝑛)
80	79	eleq1d 2307	. . . . . . 7 ⊢ (𝑤 = 𝑛 → (-𝑤 ∈ 𝐴 ↔ -𝑛 ∈ 𝐴))
81	80	cbvrabv 2820	. . . . . 6 ⊢ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} = {𝑛 ∈ ℤ ∣ -𝑛 ∈ 𝐴}
82	78, 81	elrab2 2985	. . . . 5 ⊢ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ↔ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ ∧ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴))
83	82	simprbi 275	. . . 4 ⊢ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴)
84	76, 83	syl 14	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴)
85		ssrab2 3333	. . . . . . . . 9 ⊢ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ ℤ
86	85, 75	sselid 3246	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ)
87	86	zred 9747	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℝ)
88	87	renegcld 8697	. . . . . 6 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℝ)
89	41, 42, 63, 72	infssuzledc 10645	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ (ℤ_≥‘-𝑛) ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ≤ -𝑎)
90	38, 89	eqbrtrd 4147	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ≤ -𝑎)
91	87, 53, 90	lenegcon2d 8846	. . . . . 6 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → 𝑎 ≤ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
92	53, 88, 91	lensymd 8438	. . . . 5 ⊢ (((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑎 ∈ 𝐴) → ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎)
93	92	ralrimiva 2623	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑎 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎)
94		breq2 4129	. . . . . 6 ⊢ (𝑎 = 𝑦 → (-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
95	94	notbid 677	. . . . 5 ⊢ (𝑎 = 𝑦 → (¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎 ↔ ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
96	95	cbvralv 2786	. . . 4 ⊢ (∀𝑎 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑎 ↔ ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦)
97	93, 96	sylib 122	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦)
98		breq2 4129	. . . . . . 7 ⊢ (𝑧 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑦 < 𝑧 ↔ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )))
99	98	rspcev 2929	. . . . . 6 ⊢ ((-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 ∧ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)
100	99	ex 115	. . . . 5 ⊢ (-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 → (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
101	84, 100	syl 14	. . . 4 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
102	101	ralrimivw 2624	. . 3 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
103		breq1 4128	. . . . . . 7 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑥 < 𝑦 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
104	103	notbid 677	. . . . . 6 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (¬ 𝑥 < 𝑦 ↔ ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
105	104	ralbidv 2550	. . . . 5 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
106		breq2 4129	. . . . . . 7 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑦 < 𝑥 ↔ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )))
107	106	imbi1d 231	. . . . . 6 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ((𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
108	107	ralbidv 2550	. . . . 5 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
109	105, 108	anbi12d 477	. . . 4 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ((∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)) ↔ (∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))))
110	109	rspcev 2929	. . 3 ⊢ ((-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
111	84, 97, 102, 110	syl12anc 1276	. 2 ⊢ ((𝜑 ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
112	8, 111	rexlimddv 2673	1 ⊢ (𝜑 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 DECID wdc 846 ∧ w3a 1009 = wceq 1402 ∃wex 1545 ∈ wcel 2209 ∀wral 2528 ∃wrex 2529 {crab 2532 ⊆ wss 3220 class class class wbr 4125 ‘cfv 5372 (class class class)co 6075 infcinf 7313 ℝcr 8168 < clt 8350 ≤ cle 8351 -cneg 8488 ℤcz 9623 ℤ_≥cuz 9900 ...cfz 10390

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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-cnex 8260 ax-resscn 8261 ax-1cn 8262 ax-1re 8263 ax-icn 8264 ax-addcl 8265 ax-addrcl 8266 ax-mulcl 8267 ax-addcom 8269 ax-addass 8271 ax-distr 8273 ax-i2m1 8274 ax-0lt1 8275 ax-0id 8277 ax-rnegex 8278 ax-cnre 8280 ax-pre-ltirr 8281 ax-pre-ltwlin 8282 ax-pre-lttrn 8283 ax-pre-apti 8284 ax-pre-ltadd 8285

This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-iun 4009 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-po 4436 df-iso 4437 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-isom 5381 df-riota 6028 df-ov 6078 df-oprab 6079 df-mpo 6080 df-1st 6364 df-2nd 6365 df-sup 7314 df-inf 7315 df-pnf 8352 df-mnf 8353 df-xr 8354 df-ltxr 8355 df-le 8356 df-sub 8489 df-neg 8490 df-inn 9284 df-n0 9543 df-z 9624 df-uz 9901 df-fz 10391 df-fzo 10528

This theorem is referenced by: suprzcl2dc 10652

W3C validator