zsupss - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > zsupss		Structured version Visualization version GIF version

Theorem zsupss 12677

Description: Any nonempty bounded subset of integers has a supremum in the set. (The proof does not use ax-pre-sup 10949.) (Contributed by Mario Carneiro, 21-Apr-2015.)

**Assertion**
Ref	Expression
zsupss	⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))

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

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

Step	Hyp	Ref	Expression
1		breq1 5077	. . . . . 6 ⊢ (𝑦 = 𝑚 → (𝑦 ≤ 𝑥 ↔ 𝑚 ≤ 𝑥))
2	1	cbvralvw 3383	. . . . 5 ⊢ (∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑥)
3		breq2 5078	. . . . . 6 ⊢ (𝑥 = 𝑛 → (𝑚 ≤ 𝑥 ↔ 𝑚 ≤ 𝑛))
4	3	ralbidv 3112	. . . . 5 ⊢ (𝑥 = 𝑛 → (∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛))
5	2, 4	bitrid 282	. . . 4 ⊢ (𝑥 = 𝑛 → (∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛))
6	5	cbvrexvw 3384	. . 3 ⊢ (∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 ↔ ∃𝑛 ∈ ℤ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
7		simp1rl 1237	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑛 ∈ ℤ)
8	7	znegcld 12428	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑛 ∈ ℤ)
9		simp2 1136	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℤ)
10	9	zred 12426	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ ℝ)
11	7	zred 12426	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑛 ∈ ℝ)
12		breq1 5077	. . . . . . . . . . 11 ⊢ (𝑚 = -𝑤 → (𝑚 ≤ 𝑛 ↔ -𝑤 ≤ 𝑛))
13		simp1rr 1238	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)
14		simp3 1137	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑤 ∈ 𝐴)
15	12, 13, 14	rspcdva 3562	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑤 ≤ 𝑛)
16	10, 11, 15	lenegcon1d 11557	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → -𝑛 ≤ 𝑤)
17		eluz2 12588	. . . . . . . . 9 ⊢ (𝑤 ∈ (ℤ_≥‘-𝑛) ↔ (-𝑛 ∈ ℤ ∧ 𝑤 ∈ ℤ ∧ -𝑛 ≤ 𝑤))
18	8, 9, 16, 17	syl3anbrc 1342	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑤 ∈ ℤ ∧ -𝑤 ∈ 𝐴) → 𝑤 ∈ (ℤ_≥‘-𝑛))
19	18	rabssdv 4008	. . . . . . 7 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ (ℤ_≥‘-𝑛))
20		n0 4280	. . . . . . . . . 10 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑛 𝑛 ∈ 𝐴)
21		ssel2 3916	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → 𝑛 ∈ ℤ)
22	21	znegcld 12428	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → -𝑛 ∈ ℤ)
23	21	zcnd 12427	. . . . . . . . . . . . . . . 16 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → 𝑛 ∈ ℂ)
24	23	negnegd 11323	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → --𝑛 = 𝑛)
25		simpr 485	. . . . . . . . . . . . . . 15 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → 𝑛 ∈ 𝐴)
26	24, 25	eqeltrd 2839	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → --𝑛 ∈ 𝐴)
27		negeq 11213	. . . . . . . . . . . . . . . 16 ⊢ (𝑤 = -𝑛 → -𝑤 = --𝑛)
28	27	eleq1d 2823	. . . . . . . . . . . . . . 15 ⊢ (𝑤 = -𝑛 → (-𝑤 ∈ 𝐴 ↔ --𝑛 ∈ 𝐴))
29	28	rspcev 3561	. . . . . . . . . . . . . 14 ⊢ ((-𝑛 ∈ ℤ ∧ --𝑛 ∈ 𝐴) → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴)
30	22, 26, 29	syl2anc 584	. . . . . . . . . . . . 13 ⊢ ((𝐴 ⊆ ℤ ∧ 𝑛 ∈ 𝐴) → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴)
31	30	ex 413	. . . . . . . . . . . 12 ⊢ (𝐴 ⊆ ℤ → (𝑛 ∈ 𝐴 → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴))
32	31	exlimdv 1936	. . . . . . . . . . 11 ⊢ (𝐴 ⊆ ℤ → (∃𝑛 𝑛 ∈ 𝐴 → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴))
33	32	imp 407	. . . . . . . . . 10 ⊢ ((𝐴 ⊆ ℤ ∧ ∃𝑛 𝑛 ∈ 𝐴) → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴)
34	20, 33	sylan2b 594	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴)
35	34	adantr 481	. . . . . . . 8 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴)
36		rabn0 4319	. . . . . . . 8 ⊢ ({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ≠ ∅ ↔ ∃𝑤 ∈ ℤ -𝑤 ∈ 𝐴)
37	35, 36	sylibr 233	. . . . . . 7 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ≠ ∅)
38		infssuzcl 12672	. . . . . . 7 ⊢ (({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ (ℤ_≥‘-𝑛) ∧ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ≠ ∅) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
39	19, 37, 38	syl2anc 584	. . . . . 6 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
40		negeq 11213	. . . . . . . . 9 ⊢ (𝑛 = inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → -𝑛 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
41	40	eleq1d 2823	. . . . . . . 8 ⊢ (𝑛 = inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (-𝑛 ∈ 𝐴 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴))
42		negeq 11213	. . . . . . . . . 10 ⊢ (𝑤 = 𝑛 → -𝑤 = -𝑛)
43	42	eleq1d 2823	. . . . . . . . 9 ⊢ (𝑤 = 𝑛 → (-𝑤 ∈ 𝐴 ↔ -𝑛 ∈ 𝐴))
44	43	cbvrabv 3426	. . . . . . . 8 ⊢ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} = {𝑛 ∈ ℤ ∣ -𝑛 ∈ 𝐴}
45	41, 44	elrab2 3627	. . . . . . 7 ⊢ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ↔ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ ∧ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴))
46	45	simprbi 497	. . . . . 6 ⊢ (inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴)
47	39, 46	syl 17	. . . . 5 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴)
48		simpll 764	. . . . . . . . 9 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → 𝐴 ⊆ ℤ)
49	48	sselda 3921	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℤ)
50	49	zred 12426	. . . . . . 7 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℝ)
51		ssrab2 4013	. . . . . . . . . 10 ⊢ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ ℤ
52	39	adantr 481	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
53	51, 52	sselid 3919	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ)
54	53	znegcld 12428	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℤ)
55	54	zred 12426	. . . . . . 7 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℝ)
56	53	zred 12426	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ ℝ)
57	19	adantr 481	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ (ℤ_≥‘-𝑛))
58		negeq 11213	. . . . . . . . . . 11 ⊢ (𝑤 = -𝑦 → -𝑤 = --𝑦)
59	58	eleq1d 2823	. . . . . . . . . 10 ⊢ (𝑤 = -𝑦 → (-𝑤 ∈ 𝐴 ↔ --𝑦 ∈ 𝐴))
60	49	znegcld 12428	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → -𝑦 ∈ ℤ)
61	49	zcnd 12427	. . . . . . . . . . . 12 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ ℂ)
62	61	negnegd 11323	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → --𝑦 = 𝑦)
63		simpr 485	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
64	62, 63	eqeltrd 2839	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → --𝑦 ∈ 𝐴)
65	59, 60, 64	elrabd 3626	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → -𝑦 ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴})
66		infssuzle 12671	. . . . . . . . 9 ⊢ (({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴} ⊆ (ℤ_≥‘-𝑛) ∧ -𝑦 ∈ {𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ≤ -𝑦)
67	57, 65, 66	syl2anc 584	. . . . . . . 8 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ≤ -𝑦)
68	56, 50, 67	lenegcon2d 11558	. . . . . . 7 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → 𝑦 ≤ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ))
69	50, 55, 68	lensymd 11126	. . . . . 6 ⊢ ((((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) ∧ 𝑦 ∈ 𝐴) → ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦)
70	69	ralrimiva 3103	. . . . 5 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦)
71		breq2 5078	. . . . . . . . 9 ⊢ (𝑧 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑦 < 𝑧 ↔ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )))
72	71	rspcev 3561	. . . . . . . 8 ⊢ ((-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 ∧ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)
73	72	ex 413	. . . . . . 7 ⊢ (-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 → (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
74	47, 73	syl 17	. . . . . 6 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
75	74	ralrimivw 3104	. . . . 5 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))
76		breq1 5077	. . . . . . . . 9 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑥 < 𝑦 ↔ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
77	76	notbid 318	. . . . . . . 8 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (¬ 𝑥 < 𝑦 ↔ ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
78	77	ralbidv 3112	. . . . . . 7 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦))
79		breq2 5078	. . . . . . . . 9 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (𝑦 < 𝑥 ↔ 𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < )))
80	79	imbi1d 342	. . . . . . . 8 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ((𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
81	80	ralbidv 3112	. . . . . . 7 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → (∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
82	78, 81	anbi12d 631	. . . . . 6 ⊢ (𝑥 = -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ((∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)) ↔ (∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))))
83	82	rspcev 3561	. . . . 5 ⊢ ((-inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) ∈ 𝐴 ∧ (∀𝑦 ∈ 𝐴 ¬ -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < -inf({𝑤 ∈ ℤ ∣ -𝑤 ∈ 𝐴}, ℝ, < ) → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
84	47, 70, 75, 83	syl12anc 834	. . . 4 ⊢ (((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) ∧ (𝑛 ∈ ℤ ∧ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛)) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
85	84	rexlimdvaa 3214	. . 3 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) → (∃𝑛 ∈ ℤ ∀𝑚 ∈ 𝐴 𝑚 ≤ 𝑛 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))))
86	6, 85	syl5bi 241	. 2 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅) → (∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥 → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧))))
87	86	3impia 1116	1 ⊢ ((𝐴 ⊆ ℤ ∧ 𝐴 ≠ ∅ ∧ ∃𝑥 ∈ ℤ ∀𝑦 ∈ 𝐴 𝑦 ≤ 𝑥) → ∃𝑥 ∈ 𝐴 (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ 𝐵 (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1539 ∃wex 1782 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 {crab 3068 ⊆ wss 3887 ∅c0 4256 class class class wbr 5074 ‘cfv 6433 infcinf 9200 ℝcr 10870 < clt 11009 ≤ cle 11010 -cneg 11206 ℤcz 12319 ℤ_≥cuz 12582

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-inf 9202 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-nn 11974 df-n0 12234 df-z 12320 df-uz 12583

This theorem is referenced by: suprzcl2 12678 suprzub 12679 uzsupss 12680

W3C validator