suprzclex - Intuitionistic Logic Explorer

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

Theorem suprzclex 9340

Description: The supremum of a set of integers is an element of the set. (Contributed by Jim Kingdon, 20-Dec-2021.)

**Hypotheses**
Ref	Expression
suprzclex.ex	⊢ (𝜑 → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
suprzclex.ss	⊢ (𝜑 → 𝐴 ⊆ ℤ)

**Assertion**
Ref	Expression
suprzclex	⊢ (𝜑 → sup(𝐴, ℝ, < ) ∈ 𝐴)

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

Proof of Theorem suprzclex Dummy variables 𝑤 𝑓 𝑔 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lttri3 8027	. . . . . 6 ⊢ ((𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ) → (𝑓 = 𝑔 ↔ (¬ 𝑓 < 𝑔 ∧ ¬ 𝑔 < 𝑓)))
2	1	adantl 277	. . . . 5 ⊢ ((𝜑 ∧ (𝑓 ∈ ℝ ∧ 𝑔 ∈ ℝ)) → (𝑓 = 𝑔 ↔ (¬ 𝑓 < 𝑔 ∧ ¬ 𝑔 < 𝑓)))
3		suprzclex.ex	. . . . 5 ⊢ (𝜑 → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
4	2, 3	supclti 6991	. . . 4 ⊢ (𝜑 → sup(𝐴, ℝ, < ) ∈ ℝ)
5	4	ltm1d 8878	. . 3 ⊢ (𝜑 → (sup(𝐴, ℝ, < ) − 1) < sup(𝐴, ℝ, < ))
6		suprzclex.ss	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℤ)
7		zssre 9249	. . . . 5 ⊢ ℤ ⊆ ℝ
8	6, 7	sstrdi 3167	. . . 4 ⊢ (𝜑 → 𝐴 ⊆ ℝ)
9		peano2rem 8214	. . . . 5 ⊢ (sup(𝐴, ℝ, < ) ∈ ℝ → (sup(𝐴, ℝ, < ) − 1) ∈ ℝ)
10	4, 9	syl 14	. . . 4 ⊢ (𝜑 → (sup(𝐴, ℝ, < ) − 1) ∈ ℝ)
11	3, 8, 10	suprlubex 8898	. . 3 ⊢ (𝜑 → ((sup(𝐴, ℝ, < ) − 1) < sup(𝐴, ℝ, < ) ↔ ∃𝑧 ∈ 𝐴 (sup(𝐴, ℝ, < ) − 1) < 𝑧))
12	5, 11	mpbid 147	. 2 ⊢ (𝜑 → ∃𝑧 ∈ 𝐴 (sup(𝐴, ℝ, < ) − 1) < 𝑧)
13	6	adantr 276	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 𝐴 ⊆ ℤ)
14	13	sselda 3155	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ℤ)
15	7, 14	sselid 3153	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ℝ)
16	4	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → sup(𝐴, ℝ, < ) ∈ ℝ)
17	16	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → sup(𝐴, ℝ, < ) ∈ ℝ)
18		simprl 529	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 𝑧 ∈ 𝐴)
19	13, 18	sseldd 3156	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 𝑧 ∈ ℤ)
20		zre 9246	. . . . . . . . . . 11 ⊢ (𝑧 ∈ ℤ → 𝑧 ∈ ℝ)
21	19, 20	syl 14	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 𝑧 ∈ ℝ)
22		peano2re 8083	. . . . . . . . . 10 ⊢ (𝑧 ∈ ℝ → (𝑧 + 1) ∈ ℝ)
23	21, 22	syl 14	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → (𝑧 + 1) ∈ ℝ)
24	23	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → (𝑧 + 1) ∈ ℝ)
25	3	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)))
26	8	ad2antrr 488	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝐴 ⊆ ℝ)
27		simpr 110	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ 𝐴)
28	25, 26, 27	suprubex 8897	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ≤ sup(𝐴, ℝ, < ))
29		simprr 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → (sup(𝐴, ℝ, < ) − 1) < 𝑧)
30		1red 7963	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 1 ∈ ℝ)
31	16, 30, 21	ltsubaddd 8488	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → ((sup(𝐴, ℝ, < ) − 1) < 𝑧 ↔ sup(𝐴, ℝ, < ) < (𝑧 + 1)))
32	29, 31	mpbid 147	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → sup(𝐴, ℝ, < ) < (𝑧 + 1))
33	32	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → sup(𝐴, ℝ, < ) < (𝑧 + 1))
34	15, 17, 24, 28, 33	lelttrd 8072	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑤 < (𝑧 + 1))
35	19	adantr 276	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑧 ∈ ℤ)
36		zleltp1 9297	. . . . . . . 8 ⊢ ((𝑤 ∈ ℤ ∧ 𝑧 ∈ ℤ) → (𝑤 ≤ 𝑧 ↔ 𝑤 < (𝑧 + 1)))
37	14, 35, 36	syl2anc 411	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → (𝑤 ≤ 𝑧 ↔ 𝑤 < (𝑧 + 1)))
38	34, 37	mpbird 167	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) ∧ 𝑤 ∈ 𝐴) → 𝑤 ≤ 𝑧)
39	38	ralrimiva 2550	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → ∀𝑤 ∈ 𝐴 𝑤 ≤ 𝑧)
40		breq2 4004	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → (𝑦 < 𝑧 ↔ 𝑦 < 𝑤))
41	40	cbvrexv 2704	. . . . . . . . . . . 12 ⊢ (∃𝑧 ∈ 𝐴 𝑦 < 𝑧 ↔ ∃𝑤 ∈ 𝐴 𝑦 < 𝑤)
42	41	imbi2i 226	. . . . . . . . . . 11 ⊢ ((𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ (𝑦 < 𝑥 → ∃𝑤 ∈ 𝐴 𝑦 < 𝑤))
43	42	ralbii 2483	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧) ↔ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑤 ∈ 𝐴 𝑦 < 𝑤))
44	43	anbi2i 457	. . . . . . . . 9 ⊢ ((∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)) ↔ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑤 ∈ 𝐴 𝑦 < 𝑤)))
45	44	rexbii 2484	. . . . . . . 8 ⊢ (∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑧 ∈ 𝐴 𝑦 < 𝑧)) ↔ ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑤 ∈ 𝐴 𝑦 < 𝑤)))
46	3, 45	sylib 122	. . . . . . 7 ⊢ (𝜑 → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑤 ∈ 𝐴 𝑦 < 𝑤)))
47	46	adantr 276	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → ∃𝑥 ∈ ℝ (∀𝑦 ∈ 𝐴 ¬ 𝑥 < 𝑦 ∧ ∀𝑦 ∈ ℝ (𝑦 < 𝑥 → ∃𝑤 ∈ 𝐴 𝑦 < 𝑤)))
48	13, 7	sstrdi 3167	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 𝐴 ⊆ ℝ)
49	47, 48, 21	suprleubex 8900	. . . . 5 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → (sup(𝐴, ℝ, < ) ≤ 𝑧 ↔ ∀𝑤 ∈ 𝐴 𝑤 ≤ 𝑧))
50	39, 49	mpbird 167	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → sup(𝐴, ℝ, < ) ≤ 𝑧)
51	47, 48, 18	suprubex 8897	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → 𝑧 ≤ sup(𝐴, ℝ, < ))
52	16, 21	letri3d 8063	. . . 4 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → (sup(𝐴, ℝ, < ) = 𝑧 ↔ (sup(𝐴, ℝ, < ) ≤ 𝑧 ∧ 𝑧 ≤ sup(𝐴, ℝ, < ))))
53	50, 51, 52	mpbir2and 944	. . 3 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → sup(𝐴, ℝ, < ) = 𝑧)
54	53, 18	eqeltrd 2254	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐴 ∧ (sup(𝐴, ℝ, < ) − 1) < 𝑧)) → sup(𝐴, ℝ, < ) ∈ 𝐴)
55	12, 54	rexlimddv 2599	1 ⊢ (𝜑 → sup(𝐴, ℝ, < ) ∈ 𝐴)

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 ∀wral 2455 ∃wrex 2456 ⊆ wss 3129 class class class wbr 4000 (class class class)co 5869 supcsup 6975 ℝcr 7801 1c1 7803 + caddc 7805 < clt 7982 ≤ cle 7983 − cmin 8118 ℤcz 9242

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 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-pow 4171 ax-pr 4206 ax-un 4430 ax-setind 4533 ax-cnex 7893 ax-resscn 7894 ax-1cn 7895 ax-1re 7896 ax-icn 7897 ax-addcl 7898 ax-addrcl 7899 ax-mulcl 7900 ax-addcom 7902 ax-addass 7904 ax-distr 7906 ax-i2m1 7907 ax-0lt1 7908 ax-0id 7910 ax-rnegex 7911 ax-cnre 7913 ax-pre-ltirr 7914 ax-pre-ltwlin 7915 ax-pre-lttrn 7916 ax-pre-apti 7917 ax-pre-ltadd 7918

This theorem depends on definitions: df-bi 117 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-int 3843 df-br 4001 df-opab 4062 df-id 4290 df-po 4293 df-iso 4294 df-xp 4629 df-rel 4630 df-cnv 4631 df-co 4632 df-dm 4633 df-iota 5174 df-fun 5214 df-fv 5220 df-riota 5825 df-ov 5872 df-oprab 5873 df-mpo 5874 df-sup 6977 df-pnf 7984 df-mnf 7985 df-xr 7986 df-ltxr 7987 df-le 7988 df-sub 8120 df-neg 8121 df-inn 8909 df-n0 9166 df-z 9243

This theorem is referenced by: infssuzcldc 11935 gcddvds 11947

W3C validator