stoweidlem14 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > stoweidlem14		Structured version Visualization version GIF version

Theorem stoweidlem14 46043

Description: There exists a 𝑘 as in the proof of Lemma 1 in [BrosowskiDeutsh] p. 90: 𝑘 is an integer and 1 < k * δ < 2. 𝐷 is used to represent δ in the paper. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

**Hypotheses**
Ref	Expression
stoweidlem14.1	⊢ 𝐴 = {𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗}
stoweidlem14.2	⊢ (𝜑 → 𝐷 ∈ ℝ⁺)
stoweidlem14.3	⊢ (𝜑 → 𝐷 < 1)

**Assertion**
Ref	Expression
stoweidlem14	⊢ (𝜑 → ∃𝑘 ∈ ℕ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1))

Distinct variable groups: 𝑗,𝑘,𝐷 𝐴,𝑘 𝜑,𝑘 Allowed substitution hints: 𝜑(𝑗) 𝐴(𝑗)

Proof of Theorem stoweidlem14 Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		stoweidlem14.1	. . . . . 6 ⊢ 𝐴 = {𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗}
2		ssrab2 4055	. . . . . . 7 ⊢ {𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗} ⊆ ℕ
3	2	a1i 11	. . . . . 6 ⊢ (𝜑 → {𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗} ⊆ ℕ)
4	1, 3	eqsstrid 3997	. . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℕ)
5		stoweidlem14.2	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ ℝ⁺)
6	5	rprecred 13062	. . . . . 6 ⊢ (𝜑 → (1 / 𝐷) ∈ ℝ)
7		arch 12498	. . . . . 6 ⊢ ((1 / 𝐷) ∈ ℝ → ∃𝑘 ∈ ℕ (1 / 𝐷) < 𝑘)
8		breq2 5123	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑘 → ((1 / 𝐷) < 𝑗 ↔ (1 / 𝐷) < 𝑘))
9	8	elrab 3671	. . . . . . . . . 10 ⊢ (𝑘 ∈ {𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗} ↔ (𝑘 ∈ ℕ ∧ (1 / 𝐷) < 𝑘))
10	9	biimpri 228	. . . . . . . . 9 ⊢ ((𝑘 ∈ ℕ ∧ (1 / 𝐷) < 𝑘) → 𝑘 ∈ {𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗})
11	10, 1	eleqtrrdi 2845	. . . . . . . 8 ⊢ ((𝑘 ∈ ℕ ∧ (1 / 𝐷) < 𝑘) → 𝑘 ∈ 𝐴)
12		simpr 484	. . . . . . . 8 ⊢ ((𝑘 ∈ ℕ ∧ (1 / 𝐷) < 𝑘) → (1 / 𝐷) < 𝑘)
13	11, 12	jca 511	. . . . . . 7 ⊢ ((𝑘 ∈ ℕ ∧ (1 / 𝐷) < 𝑘) → (𝑘 ∈ 𝐴 ∧ (1 / 𝐷) < 𝑘))
14	13	reximi2 3069	. . . . . 6 ⊢ (∃𝑘 ∈ ℕ (1 / 𝐷) < 𝑘 → ∃𝑘 ∈ 𝐴 (1 / 𝐷) < 𝑘)
15		rexn0 4486	. . . . . 6 ⊢ (∃𝑘 ∈ 𝐴 (1 / 𝐷) < 𝑘 → 𝐴 ≠ ∅)
16	6, 7, 14, 15	4syl 19	. . . . 5 ⊢ (𝜑 → 𝐴 ≠ ∅)
17		nnwo 12929	. . . . 5 ⊢ ((𝐴 ⊆ ℕ ∧ 𝐴 ≠ ∅) → ∃𝑘 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)
18	4, 16, 17	syl2anc 584	. . . 4 ⊢ (𝜑 → ∃𝑘 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)
19		df-rex 3061	. . . 4 ⊢ (∃𝑘 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧 ↔ ∃𝑘(𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧))
20	18, 19	sylib 218	. . 3 ⊢ (𝜑 → ∃𝑘(𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧))
21	8, 1	elrab2 3674	. . . . . . . 8 ⊢ (𝑘 ∈ 𝐴 ↔ (𝑘 ∈ ℕ ∧ (1 / 𝐷) < 𝑘))
22	21	simplbi 497	. . . . . . 7 ⊢ (𝑘 ∈ 𝐴 → 𝑘 ∈ ℕ)
23	22	ad2antrl 728	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → 𝑘 ∈ ℕ)
24		simpl 482	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → 𝜑)
25		simprl 770	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → 𝑘 ∈ 𝐴)
26		simprr 772	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)
27		nfcv 2898	. . . . . . . . 9 ⊢ Ⅎ𝑧𝐴
28		nfrab1 3436	. . . . . . . . . 10 ⊢ Ⅎ𝑗{𝑗 ∈ ℕ ∣ (1 / 𝐷) < 𝑗}
29	1, 28	nfcxfr 2896	. . . . . . . . 9 ⊢ Ⅎ𝑗𝐴
30		nfv 1914	. . . . . . . . 9 ⊢ Ⅎ𝑗 𝑘 ≤ 𝑧
31		nfv 1914	. . . . . . . . 9 ⊢ Ⅎ𝑧 𝑘 ≤ 𝑗
32		breq2 5123	. . . . . . . . 9 ⊢ (𝑧 = 𝑗 → (𝑘 ≤ 𝑧 ↔ 𝑘 ≤ 𝑗))
33	27, 29, 30, 31, 32	cbvralfw 3284	. . . . . . . 8 ⊢ (∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧 ↔ ∀𝑗 ∈ 𝐴 𝑘 ≤ 𝑗)
34	26, 33	sylib 218	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → ∀𝑗 ∈ 𝐴 𝑘 ≤ 𝑗)
35	21	simprbi 496	. . . . . . . . 9 ⊢ (𝑘 ∈ 𝐴 → (1 / 𝐷) < 𝑘)
36	35	ad2antrl 728	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑗 ∈ 𝐴 𝑘 ≤ 𝑗)) → (1 / 𝐷) < 𝑘)
37	22	ad2antrl 728	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑗 ∈ 𝐴 𝑘 ≤ 𝑗)) → 𝑘 ∈ ℕ)
38		1red 11236	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 1 ∈ ℝ)
39		nnre 12247	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℝ)
40	39	adantl 481	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℝ)
41	5	rpregt0d 13057	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐷 ∈ ℝ ∧ 0 < 𝐷))
42	41	adantr 480	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐷 ∈ ℝ ∧ 0 < 𝐷))
43		ltdivmul2 12119	. . . . . . . . . 10 ⊢ ((1 ∈ ℝ ∧ 𝑘 ∈ ℝ ∧ (𝐷 ∈ ℝ ∧ 0 < 𝐷)) → ((1 / 𝐷) < 𝑘 ↔ 1 < (𝑘 · 𝐷)))
44	38, 40, 42, 43	syl3anc 1373	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((1 / 𝐷) < 𝑘 ↔ 1 < (𝑘 · 𝐷)))
45	37, 44	syldan 591	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑗 ∈ 𝐴 𝑘 ≤ 𝑗)) → ((1 / 𝐷) < 𝑘 ↔ 1 < (𝑘 · 𝐷)))
46	36, 45	mpbid 232	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑗 ∈ 𝐴 𝑘 ≤ 𝑗)) → 1 < (𝑘 · 𝐷))
47	24, 25, 34, 46	syl12anc 836	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → 1 < (𝑘 · 𝐷))
48		oveq1 7412	. . . . . . . . . . . 12 ⊢ (𝑘 = 1 → (𝑘 · 𝐷) = (1 · 𝐷))
49	48	adantl 481	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 = 1) → (𝑘 · 𝐷) = (1 · 𝐷))
50	5	rpcnd 13053	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐷 ∈ ℂ)
51	50	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 = 1) → 𝐷 ∈ ℂ)
52	51	mullidd 11253	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 = 1) → (1 · 𝐷) = 𝐷)
53	49, 52	eqtrd 2770	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 = 1) → (𝑘 · 𝐷) = 𝐷)
54	53	oveq1d 7420	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 = 1) → ((𝑘 · 𝐷) / 2) = (𝐷 / 2))
55	5	rpred 13051	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 ∈ ℝ)
56	55	rehalfcld 12488	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐷 / 2) ∈ ℝ)
57		halfre 12454	. . . . . . . . . . . 12 ⊢ (1 / 2) ∈ ℝ
58	57	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
59		1red 11236	. . . . . . . . . . 11 ⊢ (𝜑 → 1 ∈ ℝ)
60		stoweidlem14.3	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐷 < 1)
61		2re 12314	. . . . . . . . . . . . . 14 ⊢ 2 ∈ ℝ
62	61	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 2 ∈ ℝ)
63		2pos 12343	. . . . . . . . . . . . . 14 ⊢ 0 < 2
64	63	a1i 11	. . . . . . . . . . . . 13 ⊢ (𝜑 → 0 < 2)
65		ltdiv1 12106	. . . . . . . . . . . . 13 ⊢ ((𝐷 ∈ ℝ ∧ 1 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (𝐷 < 1 ↔ (𝐷 / 2) < (1 / 2)))
66	55, 59, 62, 64, 65	syl112anc 1376	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐷 < 1 ↔ (𝐷 / 2) < (1 / 2)))
67	60, 66	mpbid 232	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐷 / 2) < (1 / 2))
68		halflt1 12458	. . . . . . . . . . . 12 ⊢ (1 / 2) < 1
69	68	a1i 11	. . . . . . . . . . 11 ⊢ (𝜑 → (1 / 2) < 1)
70	56, 58, 59, 67, 69	lttrd 11396	. . . . . . . . . 10 ⊢ (𝜑 → (𝐷 / 2) < 1)
71	70	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 = 1) → (𝐷 / 2) < 1)
72	54, 71	eqbrtrd 5141	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 = 1) → ((𝑘 · 𝐷) / 2) < 1)
73	72	adantlr 715	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ 𝑘 = 1) → ((𝑘 · 𝐷) / 2) < 1)
74		simpll 766	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝜑)
75		simplrl 776	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝑘 ∈ 𝐴)
76	75, 22	syl 17	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝑘 ∈ ℕ)
77		neqne 2940	. . . . . . . . . 10 ⊢ (¬ 𝑘 = 1 → 𝑘 ≠ 1)
78	77	adantl 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝑘 ≠ 1)
79		eluz2b3 12938	. . . . . . . . 9 ⊢ (𝑘 ∈ (ℤ_≥‘2) ↔ (𝑘 ∈ ℕ ∧ 𝑘 ≠ 1))
80	76, 78, 79	sylanbrc 583	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝑘 ∈ (ℤ_≥‘2))
81		peano2rem 11550	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℝ → (𝑘 − 1) ∈ ℝ)
82	75, 22, 39, 81	4syl 19	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → (𝑘 − 1) ∈ ℝ)
83	55	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝐷 ∈ ℝ)
84	5	rpne0d 13056	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐷 ≠ 0)
85	84	ad2antrr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 𝐷 ≠ 0)
86	83, 85	rereccld 12068	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → (1 / 𝐷) ∈ ℝ)
87		1zzd 12623	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → 1 ∈ ℤ)
88		df-2 12303	. . . . . . . . . . . . . . 15 ⊢ 2 = (1 + 1)
89	88	fveq2i 6879	. . . . . . . . . . . . . 14 ⊢ (ℤ_≥‘2) = (ℤ_≥‘(1 + 1))
90	89	eleq2i 2826	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (ℤ_≥‘2) ↔ 𝑘 ∈ (ℤ_≥‘(1 + 1)))
91		eluzsub 12882	. . . . . . . . . . . . 13 ⊢ ((1 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑘 ∈ (ℤ_≥‘(1 + 1))) → (𝑘 − 1) ∈ (ℤ_≥‘1))
92	90, 91	syl3an3b 1407	. . . . . . . . . . . 12 ⊢ ((1 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑘 ∈ (ℤ_≥‘2)) → (𝑘 − 1) ∈ (ℤ_≥‘1))
93		nnuz 12895	. . . . . . . . . . . 12 ⊢ ℕ = (ℤ_≥‘1)
94	92, 93	eleqtrrdi 2845	. . . . . . . . . . 11 ⊢ ((1 ∈ ℤ ∧ 1 ∈ ℤ ∧ 𝑘 ∈ (ℤ_≥‘2)) → (𝑘 − 1) ∈ ℕ)
95	87, 87, 80, 94	syl3anc 1373	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → (𝑘 − 1) ∈ ℕ)
96	22, 39	syl 17	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑘 ∈ 𝐴 → 𝑘 ∈ ℝ)
97	96	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑘 − 1) ∈ 𝐴 ∧ 𝑘 ∈ 𝐴) → 𝑘 ∈ ℝ)
98	97, 81	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑘 − 1) ∈ 𝐴 ∧ 𝑘 ∈ 𝐴) → (𝑘 − 1) ∈ ℝ)
99		simpr 484	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑘 − 1) ∈ ℝ ∧ 𝑘 ∈ ℝ) → 𝑘 ∈ ℝ)
100	99	ltm1d 12174	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑘 − 1) ∈ ℝ ∧ 𝑘 ∈ ℝ) → (𝑘 − 1) < 𝑘)
101		ltnle 11314	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑘 − 1) ∈ ℝ ∧ 𝑘 ∈ ℝ) → ((𝑘 − 1) < 𝑘 ↔ ¬ 𝑘 ≤ (𝑘 − 1)))
102	100, 101	mpbid 232	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑘 − 1) ∈ ℝ ∧ 𝑘 ∈ ℝ) → ¬ 𝑘 ≤ (𝑘 − 1))
103	98, 97, 102	syl2anc 584	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑘 − 1) ∈ 𝐴 ∧ 𝑘 ∈ 𝐴) → ¬ 𝑘 ≤ (𝑘 − 1))
104		breq2 5123	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑧 = (𝑘 − 1) → (𝑘 ≤ 𝑧 ↔ 𝑘 ≤ (𝑘 − 1)))
105	104	notbid 318	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑧 = (𝑘 − 1) → (¬ 𝑘 ≤ 𝑧 ↔ ¬ 𝑘 ≤ (𝑘 − 1)))
106	105	rspcev 3601	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑘 − 1) ∈ 𝐴 ∧ ¬ 𝑘 ≤ (𝑘 − 1)) → ∃𝑧 ∈ 𝐴 ¬ 𝑘 ≤ 𝑧)
107	103, 106	syldan 591	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑘 − 1) ∈ 𝐴 ∧ 𝑘 ∈ 𝐴) → ∃𝑧 ∈ 𝐴 ¬ 𝑘 ≤ 𝑧)
108		rexnal 3089	. . . . . . . . . . . . . . . . . 18 ⊢ (∃𝑧 ∈ 𝐴 ¬ 𝑘 ≤ 𝑧 ↔ ¬ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)
109	107, 108	sylib 218	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑘 − 1) ∈ 𝐴 ∧ 𝑘 ∈ 𝐴) → ¬ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)
110	109	ex 412	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 − 1) ∈ 𝐴 → (𝑘 ∈ 𝐴 → ¬ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧))
111		imnan 399	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 ∈ 𝐴 → ¬ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧) ↔ ¬ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧))
112	110, 111	sylib 218	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 − 1) ∈ 𝐴 → ¬ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧))
113	112	con2i 139	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧) → ¬ (𝑘 − 1) ∈ 𝐴)
114	113	ad2antlr 727	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → ¬ (𝑘 − 1) ∈ 𝐴)
115		breq2 5123	. . . . . . . . . . . . . 14 ⊢ (𝑗 = (𝑘 − 1) → ((1 / 𝐷) < 𝑗 ↔ (1 / 𝐷) < (𝑘 − 1)))
116	115, 1	elrab2 3674	. . . . . . . . . . . . 13 ⊢ ((𝑘 − 1) ∈ 𝐴 ↔ ((𝑘 − 1) ∈ ℕ ∧ (1 / 𝐷) < (𝑘 − 1)))
117	114, 116	sylnib 328	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → ¬ ((𝑘 − 1) ∈ ℕ ∧ (1 / 𝐷) < (𝑘 − 1)))
118		ianor 983	. . . . . . . . . . . 12 ⊢ (¬ ((𝑘 − 1) ∈ ℕ ∧ (1 / 𝐷) < (𝑘 − 1)) ↔ (¬ (𝑘 − 1) ∈ ℕ ∨ ¬ (1 / 𝐷) < (𝑘 − 1)))
119	117, 118	sylib 218	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → (¬ (𝑘 − 1) ∈ ℕ ∨ ¬ (1 / 𝐷) < (𝑘 − 1)))
120		imor 853	. . . . . . . . . . 11 ⊢ (((𝑘 − 1) ∈ ℕ → ¬ (1 / 𝐷) < (𝑘 − 1)) ↔ (¬ (𝑘 − 1) ∈ ℕ ∨ ¬ (1 / 𝐷) < (𝑘 − 1)))
121	119, 120	sylibr 234	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → ((𝑘 − 1) ∈ ℕ → ¬ (1 / 𝐷) < (𝑘 − 1)))
122	95, 121	mpd 15	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → ¬ (1 / 𝐷) < (𝑘 − 1))
123	82, 86, 122	nltled 11385	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → (𝑘 − 1) ≤ (1 / 𝐷))
124		eluzelre 12863	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (ℤ_≥‘2) → 𝑘 ∈ ℝ)
125	124	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → 𝑘 ∈ ℝ)
126	55	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → 𝐷 ∈ ℝ)
127	125, 126	remulcld 11265	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → (𝑘 · 𝐷) ∈ ℝ)
128	127	rehalfcld 12488	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → ((𝑘 · 𝐷) / 2) ∈ ℝ)
129	128	3adant3 1132	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 · 𝐷) / 2) ∈ ℝ)
130	59, 55	readdcld 11264	. . . . . . . . . . . 12 ⊢ (𝜑 → (1 + 𝐷) ∈ ℝ)
131	130	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → (1 + 𝐷) ∈ ℝ)
132	131	rehalfcld 12488	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → ((1 + 𝐷) / 2) ∈ ℝ)
133	132	3adant3 1132	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((1 + 𝐷) / 2) ∈ ℝ)
134		1red 11236	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → 1 ∈ ℝ)
135		eluzelcn 12864	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (ℤ_≥‘2) → 𝑘 ∈ ℂ)
136	135	adantl 481	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → 𝑘 ∈ ℂ)
137	50	adantr 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → 𝐷 ∈ ℂ)
138	136, 137	mulcld 11255	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → (𝑘 · 𝐷) ∈ ℂ)
139	138	3adant3 1132	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (𝑘 · 𝐷) ∈ ℂ)
140	50	3ad2ant1 1133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → 𝐷 ∈ ℂ)
141	139, 140	npcand 11598	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (((𝑘 · 𝐷) − 𝐷) + 𝐷) = (𝑘 · 𝐷))
142	127, 126	resubcld 11665	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → ((𝑘 · 𝐷) − 𝐷) ∈ ℝ)
143	142	3adant3 1132	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 · 𝐷) − 𝐷) ∈ ℝ)
144	55	3ad2ant1 1133	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → 𝐷 ∈ ℝ)
145		simp3 1138	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (𝑘 − 1) ≤ (1 / 𝐷))
146		1red 11236	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (ℤ_≥‘2) → 1 ∈ ℝ)
147	124, 146	resubcld 11665	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (ℤ_≥‘2) → (𝑘 − 1) ∈ ℝ)
148	147	3ad2ant2 1134	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (𝑘 − 1) ∈ ℝ)
149	6	3ad2ant1 1133	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (1 / 𝐷) ∈ ℝ)
150	41	3ad2ant1 1133	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (𝐷 ∈ ℝ ∧ 0 < 𝐷))
151		lemul1 12093	. . . . . . . . . . . . . . 15 ⊢ (((𝑘 − 1) ∈ ℝ ∧ (1 / 𝐷) ∈ ℝ ∧ (𝐷 ∈ ℝ ∧ 0 < 𝐷)) → ((𝑘 − 1) ≤ (1 / 𝐷) ↔ ((𝑘 − 1) · 𝐷) ≤ ((1 / 𝐷) · 𝐷)))
152	148, 149, 150, 151	syl3anc 1373	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 − 1) ≤ (1 / 𝐷) ↔ ((𝑘 − 1) · 𝐷) ≤ ((1 / 𝐷) · 𝐷)))
153	145, 152	mpbid 232	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 − 1) · 𝐷) ≤ ((1 / 𝐷) · 𝐷))
154		1cnd 11230	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → 1 ∈ ℂ)
155	136, 154, 137	subdird 11694	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → ((𝑘 − 1) · 𝐷) = ((𝑘 · 𝐷) − (1 · 𝐷)))
156	137	mullidd 11253	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → (1 · 𝐷) = 𝐷)
157	156	oveq2d 7421	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → ((𝑘 · 𝐷) − (1 · 𝐷)) = ((𝑘 · 𝐷) − 𝐷))
158	155, 157	eqtrd 2770	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2)) → ((𝑘 − 1) · 𝐷) = ((𝑘 · 𝐷) − 𝐷))
159	158	3adant3 1132	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 − 1) · 𝐷) = ((𝑘 · 𝐷) − 𝐷))
160		1cnd 11230	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 1 ∈ ℂ)
161	160, 50, 84	3jca 1128	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → (1 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐷 ≠ 0))
162	161	3ad2ant1 1133	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (1 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐷 ≠ 0))
163		divcan1 11905	. . . . . . . . . . . . . 14 ⊢ ((1 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐷 ≠ 0) → ((1 / 𝐷) · 𝐷) = 1)
164	162, 163	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((1 / 𝐷) · 𝐷) = 1)
165	153, 159, 164	3brtr3d 5150	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 · 𝐷) − 𝐷) ≤ 1)
166	143, 134, 144, 165	leadd1dd 11851	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (((𝑘 · 𝐷) − 𝐷) + 𝐷) ≤ (1 + 𝐷))
167	141, 166	eqbrtrrd 5143	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (𝑘 · 𝐷) ≤ (1 + 𝐷))
168	127	3adant3 1132	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (𝑘 · 𝐷) ∈ ℝ)
169	130	3ad2ant1 1133	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (1 + 𝐷) ∈ ℝ)
170	61, 63	pm3.2i 470	. . . . . . . . . . . 12 ⊢ (2 ∈ ℝ ∧ 0 < 2)
171	170	a1i 11	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → (2 ∈ ℝ ∧ 0 < 2))
172		lediv1 12107	. . . . . . . . . . 11 ⊢ (((𝑘 · 𝐷) ∈ ℝ ∧ (1 + 𝐷) ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((𝑘 · 𝐷) ≤ (1 + 𝐷) ↔ ((𝑘 · 𝐷) / 2) ≤ ((1 + 𝐷) / 2)))
173	168, 169, 171, 172	syl3anc 1373	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 · 𝐷) ≤ (1 + 𝐷) ↔ ((𝑘 · 𝐷) / 2) ≤ ((1 + 𝐷) / 2)))
174	167, 173	mpbid 232	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 · 𝐷) / 2) ≤ ((1 + 𝐷) / 2))
175	55, 59, 59, 60	ltadd2dd 11394	. . . . . . . . . . . . 13 ⊢ (𝜑 → (1 + 𝐷) < (1 + 1))
176		1p1e2 12365	. . . . . . . . . . . . 13 ⊢ (1 + 1) = 2
177	175, 176	breqtrdi 5160	. . . . . . . . . . . 12 ⊢ (𝜑 → (1 + 𝐷) < 2)
178		ltdiv1 12106	. . . . . . . . . . . . 13 ⊢ (((1 + 𝐷) ∈ ℝ ∧ 2 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((1 + 𝐷) < 2 ↔ ((1 + 𝐷) / 2) < (2 / 2)))
179	130, 62, 62, 64, 178	syl112anc 1376	. . . . . . . . . . . 12 ⊢ (𝜑 → ((1 + 𝐷) < 2 ↔ ((1 + 𝐷) / 2) < (2 / 2)))
180	177, 179	mpbid 232	. . . . . . . . . . 11 ⊢ (𝜑 → ((1 + 𝐷) / 2) < (2 / 2))
181		2div2e1 12381	. . . . . . . . . . 11 ⊢ (2 / 2) = 1
182	180, 181	breqtrdi 5160	. . . . . . . . . 10 ⊢ (𝜑 → ((1 + 𝐷) / 2) < 1)
183	182	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((1 + 𝐷) / 2) < 1)
184	129, 133, 134, 174, 183	lelttrd 11393	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘2) ∧ (𝑘 − 1) ≤ (1 / 𝐷)) → ((𝑘 · 𝐷) / 2) < 1)
185	74, 80, 123, 184	syl3anc 1373	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) ∧ ¬ 𝑘 = 1) → ((𝑘 · 𝐷) / 2) < 1)
186	73, 185	pm2.61dan 812	. . . . . 6 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → ((𝑘 · 𝐷) / 2) < 1)
187	23, 47, 186	jca32 515	. . . . 5 ⊢ ((𝜑 ∧ (𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧)) → (𝑘 ∈ ℕ ∧ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1)))
188	187	ex 412	. . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧) → (𝑘 ∈ ℕ ∧ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1))))
189	188	eximdv 1917	. . 3 ⊢ (𝜑 → (∃𝑘(𝑘 ∈ 𝐴 ∧ ∀𝑧 ∈ 𝐴 𝑘 ≤ 𝑧) → ∃𝑘(𝑘 ∈ ℕ ∧ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1))))
190	20, 189	mpd 15	. 2 ⊢ (𝜑 → ∃𝑘(𝑘 ∈ ℕ ∧ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1)))
191		df-rex 3061	. 2 ⊢ (∃𝑘 ∈ ℕ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1) ↔ ∃𝑘(𝑘 ∈ ℕ ∧ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1)))
192	190, 191	sylibr 234	1 ⊢ (𝜑 → ∃𝑘 ∈ ℕ (1 < (𝑘 · 𝐷) ∧ ((𝑘 · 𝐷) / 2) < 1))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1540 ∃wex 1779 ∈ wcel 2108 ≠ wne 2932 ∀wral 3051 ∃wrex 3060 {crab 3415 ⊆ wss 3926 ∅c0 4308 class class class wbr 5119 ‘cfv 6531 (class class class)co 7405 ℂcc 11127 ℝcr 11128 0cc0 11129 1c1 11130 + caddc 11132 · cmul 11134 < clt 11269 ≤ cle 11270 − cmin 11466 / cdiv 11894 ℕcn 12240 2c2 12295 ℤcz 12588 ℤ_≥cuz 12852 ℝ⁺crp 13008

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 ax-cnex 11185 ax-resscn 11186 ax-1cn 11187 ax-icn 11188 ax-addcl 11189 ax-addrcl 11190 ax-mulcl 11191 ax-mulrcl 11192 ax-mulcom 11193 ax-addass 11194 ax-mulass 11195 ax-distr 11196 ax-i2m1 11197 ax-1ne0 11198 ax-1rid 11199 ax-rnegex 11200 ax-rrecex 11201 ax-cnre 11202 ax-pre-lttri 11203 ax-pre-lttrn 11204 ax-pre-ltadd 11205 ax-pre-mulgt0 11206 ax-pre-sup 11207

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7862 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-er 8719 df-en 8960 df-dom 8961 df-sdom 8962 df-pnf 11271 df-mnf 11272 df-xr 11273 df-ltxr 11274 df-le 11275 df-sub 11468 df-neg 11469 df-div 11895 df-nn 12241 df-2 12303 df-n0 12502 df-z 12589 df-uz 12853 df-rp 13009

This theorem is referenced by: stoweidlem49 46078

W3C validator