Theorem ruclem1 16399

Description: Lemma for ruc 16411 (the reals are uncountable). Substitutions for the function 𝐷. (Contributed by Mario Carneiro, 28-May-2014.) (Revised by Fan Zheng, 6-Jun-2016.)

Hypotheses

Ref	Expression
ruc.1	⊢ (𝜑 → 𝐹:ℕ⟶ℝ)
ruc.2	⊢ (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
ruclem1.3	⊢ (𝜑 → 𝐴 ∈ ℝ)
ruclem1.4	⊢ (𝜑 → 𝐵 ∈ ℝ)
ruclem1.5	⊢ (𝜑 → 𝑀 ∈ ℝ)
ruclem1.6	⊢ 𝑋 = (1st ‘(⟨𝐴, 𝐵⟩𝐷𝑀))
ruclem1.7	⊢ 𝑌 = (2nd ‘(⟨𝐴, 𝐵⟩𝐷𝑀))

Assertion

Ref	Expression
ruclem1	⊢ (𝜑 → ((⟨𝐴, 𝐵⟩𝐷𝑀) ∈ (ℝ × ℝ) ∧ 𝑋 = if(((𝐴 + 𝐵) / 2) < 𝑀, 𝐴, ((((𝐴 + 𝐵) / 2) + 𝐵) / 2)) ∧ 𝑌 = if(((𝐴 + 𝐵) / 2) < 𝑀, ((𝐴 + 𝐵) / 2), 𝐵)))

Distinct variable groups:   𝑥,𝑚,𝑦,𝐴   𝐵,𝑚,𝑥,𝑦   𝑚,𝐹,𝑥,𝑦   𝑚,𝑀,𝑥,𝑦

Allowed substitution hints:   𝜑(𝑥, 𝑦, 𝑚)   𝐷(𝑥, 𝑦, 𝑚)   𝑋(𝑥, 𝑦, 𝑚)   𝑌(𝑥, 𝑦, 𝑚)

Proof of Theorem ruclem1

Step	Hyp	Ref	Expression
1		ruc.2	. . . . . 6 ⊢ (𝜑 → 𝐷 = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)))
2	1	oveqd 7437	. . . . 5 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩𝐷𝑀) = (⟨𝐴, 𝐵⟩(𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩))𝑀))
3		ruclem1.3	. . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℝ)
4		ruclem1.4	. . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℝ)
5	3, 4	opelxpd 5690	. . . . . 6 ⊢ (𝜑 → ⟨𝐴, 𝐵⟩ ∈ (ℝ × ℝ))
6		ruclem1.5	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℝ)
7		simpr 490	. . . . . . . . . . 11 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → 𝑦 = 𝑀)
8	7	breq2d 5115	. . . . . . . . . 10 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → (𝑚 < 𝑦 ↔ 𝑚 < 𝑀))
9		simpl 488	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → 𝑥 = ⟨𝐴, 𝐵⟩)
10	9	fveq2d 6889	. . . . . . . . . . 11 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → (1st ‘𝑥) = (1st ‘⟨𝐴, 𝐵⟩))
11	10	opeq1d 4839	. . . . . . . . . 10 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ⟨(1st ‘𝑥), 𝑚⟩ = ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩)
12	9	fveq2d 6889	. . . . . . . . . . . . 13 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → (2nd ‘𝑥) = (2nd ‘⟨𝐴, 𝐵⟩))
13	12	oveq2d 7436	. . . . . . . . . . . 12 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → (𝑚 + (2nd ‘𝑥)) = (𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)))
14	13	oveq1d 7435	. . . . . . . . . . 11 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ((𝑚 + (2nd ‘𝑥)) / 2) = ((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2))
15	14, 12	opeq12d 4841	. . . . . . . . . 10 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩ = ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩)
16	8, 11, 15	ifbieq12d 4511	. . . . . . . . 9 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩) = if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
17	16	csbeq2dv 3854	. . . . . . . 8 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩) = ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
18	10, 12	oveq12d 7438	. . . . . . . . . 10 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ((1st ‘𝑥) + (2nd ‘𝑥)) = ((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)))
19	18	oveq1d 7435	. . . . . . . . 9 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → (((1st ‘𝑥) + (2nd ‘𝑥)) / 2) = (((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2))
20	19	csbeq1d 3851	. . . . . . . 8 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
21	17, 20	eqtrd 2796	. . . . . . 7 ⊢ ((𝑥 = ⟨𝐴, 𝐵⟩ ∧ 𝑦 = 𝑀) → ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩) = ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
22		eqid 2761	. . . . . . 7 ⊢ (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩)) = (𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩))
23		opex 5432	. . . . . . . . 9 ⊢ ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩ ∈ V
24		opex 5432	. . . . . . . . 9 ⊢ ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩ ∈ V
25	23, 24	ifex 4533	. . . . . . . 8 ⊢ if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) ∈ V
26	25	csbex 5265	. . . . . . 7 ⊢ ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) ∈ V
27	21, 22, 26	ovmpoa 7575	. . . . . 6 ⊢ ((⟨𝐴, 𝐵⟩ ∈ (ℝ × ℝ) ∧ 𝑀 ∈ ℝ) → (⟨𝐴, 𝐵⟩(𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩))𝑀) = ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
28	5, 6, 27	syl2anc 596	. . . . 5 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩(𝑥 ∈ (ℝ × ℝ), 𝑦 ∈ ℝ ↦ ⦋(((1st ‘𝑥) + (2nd ‘𝑥)) / 2) / 𝑚⦌if(𝑚 < 𝑦, ⟨(1st ‘𝑥), 𝑚⟩, ⟨((𝑚 + (2nd ‘𝑥)) / 2), (2nd ‘𝑥)⟩))𝑀) = ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
29	2, 28	eqtrd 2796	. . . 4 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩𝐷𝑀) = ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
30		op1stg 8013	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
31	3, 4, 30	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (1st ‘⟨𝐴, 𝐵⟩) = 𝐴)
32		op2ndg 8014	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
33	3, 4, 32	syl2anc 596	. . . . . . . 8 ⊢ (𝜑 → (2nd ‘⟨𝐴, 𝐵⟩) = 𝐵)
34	31, 33	oveq12d 7438	. . . . . . 7 ⊢ (𝜑 → ((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) = (𝐴 + 𝐵))
35	34	oveq1d 7435	. . . . . 6 ⊢ (𝜑 → (((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) = ((𝐴 + 𝐵) / 2))
36	35	csbeq1d 3851	. . . . 5 ⊢ (𝜑 → ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = ⦋((𝐴 + 𝐵) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
37		ovex 7453	. . . . . . 7 ⊢ ((𝐴 + 𝐵) / 2) ∈ V
38		breq1 5106	. . . . . . . 8 ⊢ (𝑚 = ((𝐴 + 𝐵) / 2) → (𝑚 < 𝑀 ↔ ((𝐴 + 𝐵) / 2) < 𝑀))
39		opeq2 4834	. . . . . . . 8 ⊢ (𝑚 = ((𝐴 + 𝐵) / 2) → ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩ = ⟨(1st ‘⟨𝐴, 𝐵⟩), ((𝐴 + 𝐵) / 2)⟩)
40		oveq1 7427	. . . . . . . . . 10 ⊢ (𝑚 = ((𝐴 + 𝐵) / 2) → (𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) = (((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)))
41	40	oveq1d 7435	. . . . . . . . 9 ⊢ (𝑚 = ((𝐴 + 𝐵) / 2) → ((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) = ((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2))
42	41	opeq1d 4839	. . . . . . . 8 ⊢ (𝑚 = ((𝐴 + 𝐵) / 2) → ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩ = ⟨((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩)
43	38, 39, 42	ifbieq12d 4511	. . . . . . 7 ⊢ (𝑚 = ((𝐴 + 𝐵) / 2) → if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩))
44	37, 43	csbie 3882	. . . . . 6 ⊢ ⦋((𝐴 + 𝐵) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩)
45	31	opeq1d 4839	. . . . . . 7 ⊢ (𝜑 → ⟨(1st ‘⟨𝐴, 𝐵⟩), ((𝐴 + 𝐵) / 2)⟩ = ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩)
46	33	oveq2d 7436	. . . . . . . . 9 ⊢ (𝜑 → (((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) = (((𝐴 + 𝐵) / 2) + 𝐵))
47	46	oveq1d 7435	. . . . . . . 8 ⊢ (𝜑 → ((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) = ((((𝐴 + 𝐵) / 2) + 𝐵) / 2))
48	47, 33	opeq12d 4841	. . . . . . 7 ⊢ (𝜑 → ⟨((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩ = ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)
49	45, 48	ifeq12d 4504	. . . . . 6 ⊢ (𝜑 → if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩))
50	44, 49	eqtrid 2808	. . . . 5 ⊢ (𝜑 → ⦋((𝐴 + 𝐵) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩))
51	36, 50	eqtrd 2796	. . . 4 ⊢ (𝜑 → ⦋(((1st ‘⟨𝐴, 𝐵⟩) + (2nd ‘⟨𝐴, 𝐵⟩)) / 2) / 𝑚⦌if(𝑚 < 𝑀, ⟨(1st ‘⟨𝐴, 𝐵⟩), 𝑚⟩, ⟨((𝑚 + (2nd ‘⟨𝐴, 𝐵⟩)) / 2), (2nd ‘⟨𝐴, 𝐵⟩)⟩) = if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩))
52	29, 51	eqtrd 2796	. . 3 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩𝐷𝑀) = if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩))
53	3, 4	readdcld 11338	. . . . . 6 ⊢ (𝜑 → (𝐴 + 𝐵) ∈ ℝ)
54	53	rehalfcld 12593	. . . . 5 ⊢ (𝜑 → ((𝐴 + 𝐵) / 2) ∈ ℝ)
55	3, 54	opelxpd 5690	. . . 4 ⊢ (𝜑 → ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩ ∈ (ℝ × ℝ))
56	54, 4	readdcld 11338	. . . . . 6 ⊢ (𝜑 → (((𝐴 + 𝐵) / 2) + 𝐵) ∈ ℝ)
57	56	rehalfcld 12593	. . . . 5 ⊢ (𝜑 → ((((𝐴 + 𝐵) / 2) + 𝐵) / 2) ∈ ℝ)
58	57, 4	opelxpd 5690	. . . 4 ⊢ (𝜑 → ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩ ∈ (ℝ × ℝ))
59	55, 58	ifcld 4529	. . 3 ⊢ (𝜑 → if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩) ∈ (ℝ × ℝ))
60	52, 59	eqeltrd 2861	. 2 ⊢ (𝜑 → (⟨𝐴, 𝐵⟩𝐷𝑀) ∈ (ℝ × ℝ))
61		ruclem1.6	. . 3 ⊢ 𝑋 = (1st ‘(⟨𝐴, 𝐵⟩𝐷𝑀))
62	52	fveq2d 6889	. . . 4 ⊢ (𝜑 → (1st ‘(⟨𝐴, 𝐵⟩𝐷𝑀)) = (1st ‘if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)))
63		fvif 6901	. . . . 5 ⊢ (1st ‘if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)) = if(((𝐴 + 𝐵) / 2) < 𝑀, (1st ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩), (1st ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩))
64		op1stg 8013	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ ((𝐴 + 𝐵) / 2) ∈ V) → (1st ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩) = 𝐴)
65	3, 37, 64	sylancl 598	. . . . . 6 ⊢ (𝜑 → (1st ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩) = 𝐴)
66		ovex 7453	. . . . . . 7 ⊢ ((((𝐴 + 𝐵) / 2) + 𝐵) / 2) ∈ V
67		op1stg 8013	. . . . . . 7 ⊢ ((((((𝐴 + 𝐵) / 2) + 𝐵) / 2) ∈ V ∧ 𝐵 ∈ ℝ) → (1st ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩) = ((((𝐴 + 𝐵) / 2) + 𝐵) / 2))
68	66, 4, 67	sylancr 599	. . . . . 6 ⊢ (𝜑 → (1st ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩) = ((((𝐴 + 𝐵) / 2) + 𝐵) / 2))
69	65, 68	ifeq12d 4504	. . . . 5 ⊢ (𝜑 → if(((𝐴 + 𝐵) / 2) < 𝑀, (1st ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩), (1st ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)) = if(((𝐴 + 𝐵) / 2) < 𝑀, 𝐴, ((((𝐴 + 𝐵) / 2) + 𝐵) / 2)))
70	63, 69	eqtrid 2808	. . . 4 ⊢ (𝜑 → (1st ‘if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)) = if(((𝐴 + 𝐵) / 2) < 𝑀, 𝐴, ((((𝐴 + 𝐵) / 2) + 𝐵) / 2)))
71	62, 70	eqtrd 2796	. . 3 ⊢ (𝜑 → (1st ‘(⟨𝐴, 𝐵⟩𝐷𝑀)) = if(((𝐴 + 𝐵) / 2) < 𝑀, 𝐴, ((((𝐴 + 𝐵) / 2) + 𝐵) / 2)))
72	61, 71	eqtrid 2808	. 2 ⊢ (𝜑 → 𝑋 = if(((𝐴 + 𝐵) / 2) < 𝑀, 𝐴, ((((𝐴 + 𝐵) / 2) + 𝐵) / 2)))
73		ruclem1.7	. . 3 ⊢ 𝑌 = (2nd ‘(⟨𝐴, 𝐵⟩𝐷𝑀))
74	52	fveq2d 6889	. . . 4 ⊢ (𝜑 → (2nd ‘(⟨𝐴, 𝐵⟩𝐷𝑀)) = (2nd ‘if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)))
75		fvif 6901	. . . . 5 ⊢ (2nd ‘if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)) = if(((𝐴 + 𝐵) / 2) < 𝑀, (2nd ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩), (2nd ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩))
76		op2ndg 8014	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ ((𝐴 + 𝐵) / 2) ∈ V) → (2nd ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩) = ((𝐴 + 𝐵) / 2))
77	3, 37, 76	sylancl 598	. . . . . 6 ⊢ (𝜑 → (2nd ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩) = ((𝐴 + 𝐵) / 2))
78		op2ndg 8014	. . . . . . 7 ⊢ ((((((𝐴 + 𝐵) / 2) + 𝐵) / 2) ∈ V ∧ 𝐵 ∈ ℝ) → (2nd ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩) = 𝐵)
79	66, 4, 78	sylancr 599	. . . . . 6 ⊢ (𝜑 → (2nd ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩) = 𝐵)
80	77, 79	ifeq12d 4504	. . . . 5 ⊢ (𝜑 → if(((𝐴 + 𝐵) / 2) < 𝑀, (2nd ‘⟨𝐴, ((𝐴 + 𝐵) / 2)⟩), (2nd ‘⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)) = if(((𝐴 + 𝐵) / 2) < 𝑀, ((𝐴 + 𝐵) / 2), 𝐵))
81	75, 80	eqtrid 2808	. . . 4 ⊢ (𝜑 → (2nd ‘if(((𝐴 + 𝐵) / 2) < 𝑀, ⟨𝐴, ((𝐴 + 𝐵) / 2)⟩, ⟨((((𝐴 + 𝐵) / 2) + 𝐵) / 2), 𝐵⟩)) = if(((𝐴 + 𝐵) / 2) < 𝑀, ((𝐴 + 𝐵) / 2), 𝐵))
82	74, 81	eqtrd 2796	. . 3 ⊢ (𝜑 → (2nd ‘(⟨𝐴, 𝐵⟩𝐷𝑀)) = if(((𝐴 + 𝐵) / 2) < 𝑀, ((𝐴 + 𝐵) / 2), 𝐵))
83	73, 82	eqtrid 2808	. 2 ⊢ (𝜑 → 𝑌 = if(((𝐴 + 𝐵) / 2) < 𝑀, ((𝐴 + 𝐵) / 2), 𝐵))
84	60, 72, 83	3jca 1146	1 ⊢ (𝜑 → ((⟨𝐴, 𝐵⟩𝐷𝑀) ∈ (ℝ × ℝ) ∧ 𝑋 = if(((𝐴 + 𝐵) / 2) < 𝑀, 𝐴, ((((𝐴 + 𝐵) / 2) + 𝐵) / 2)) ∧ 𝑌 = if(((𝐴 + 𝐵) / 2) < 𝑀, ((𝐴 + 𝐵) / 2), 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ⦋csb 3847  ifcif 4482  ⟨cop 4590   class class class wbr 5103   × cxp 5649  ⟶wf 6534  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  1^st c1st 7999  2^nd c2nd 8000  ℝcr 11199   + caddc 11203   < clt 11343   / cdiv 11973  ℕcn 12335  2c2 12397

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-resscn 11257  ax-1cn 11258  ax-icn 11259  ax-addcl 11260  ax-addrcl 11261  ax-mulcl 11262  ax-mulrcl 11263  ax-mulcom 11264  ax-addass 11265  ax-mulass 11266  ax-distr 11267  ax-i2m1 11268  ax-1ne0 11269  ax-1rid 11270  ax-rnegex 11271  ax-rrecex 11272  ax-cnre 11273  ax-pre-lttri 11274  ax-pre-lttrn 11275  ax-pre-ltadd 11276  ax-pre-mulgt0 11277

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-nel 3063  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-pnf 11345  df-mnf 11346  df-xr 11347  df-ltxr 11348  df-le 11349  df-sub 11543  df-neg 11544  df-div 11974  df-nn 12336  df-2 12405

This theorem is used by:  ruclem2  16400  ruclem3  16401  ruclem6  16403