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

Theorem halfcut 28903
Description: Relate the cut of twice of two numbers to the cut of the numbers. Lemma 4.2 of [Gonshor] p. 28. (Contributed by Scott Fenton, 7-Aug-2025.) Avoid the axiom of infinity. (Revised by Scott Fenton, 6-Sep-2025.)
Hypotheses
Ref Expression
halfcut.1 (𝜑 → 𝐴 ∈ No)
halfcut.2 (𝜑 → 𝐵 ∈ No)
halfcut.3 (𝜑 → 𝐴 <s 𝐵)
halfcut.4 (𝜑 → ({(2s ·s 𝐴)} |s {(2s ·s 𝐵)}) = (𝐴 +s 𝐵))
halfcut.5 𝐶 = ({𝐴} |s {𝐵})
Assertion
Ref Expression
halfcut (𝜑 → 𝐶 = ((𝐴 +s 𝐵) /su 2s))

Proof of Theorem halfcut
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 halfcut.5 . . . . . 6 𝐶 = ({𝐴} |s {𝐵})
2 halfcut.1 . . . . . . . 8 (𝜑 → 𝐴 ∈ No)
3 halfcut.2 . . . . . . . 8 (𝜑 → 𝐵 ∈ No)
4 halfcut.3 . . . . . . . 8 (𝜑 → 𝐴 <s 𝐵)
52, 3, 4sltssn 28215 . . . . . . 7 (𝜑 → {𝐴} <<s {𝐵})
65cutscld 28228 . . . . . 6 (𝜑 → ({𝐴} |s {𝐵}) ∈ No)
71, 6eqeltrid 2871 . . . . 5 (𝜑 → 𝐶 ∈ No)
8 no2times 28862 . . . . 5 (𝐶 ∈ No → (2s ·s 𝐶) = (𝐶 +s 𝐶))
97, 8syl 18 . . . 4 (𝜑 → (2s ·s 𝐶) = (𝐶 +s 𝐶))
101a1i 11 . . . . . 6 (𝜑 → 𝐶 = ({𝐴} |s {𝐵}))
115, 5, 10, 10addsunif 28447 . . . . 5 (𝜑 → (𝐶 +s 𝐶) = (({𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦)})))
12 oveq1 7457 . . . . . . . . . . . . 13 (𝑦 = 𝐴 → (𝑦 +s 𝐶) = (𝐴 +s 𝐶))
1312eqeq2d 2777 . . . . . . . . . . . 12 (𝑦 = 𝐴 → (𝑥 = (𝑦 +s 𝐶) ↔ 𝑥 = (𝐴 +s 𝐶)))
1413rexsng 4637 . . . . . . . . . . 11 (𝐴 ∈ No → (∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶) ↔ 𝑥 = (𝐴 +s 𝐶)))
152, 14syl 18 . . . . . . . . . 10 (𝜑 → (∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶) ↔ 𝑥 = (𝐴 +s 𝐶)))
1615abbidv 2832 . . . . . . . . 9 (𝜑 → {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶)} = {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)})
17 oveq2 7458 . . . . . . . . . . . . . 14 (𝑦 = 𝐴 → (𝐶 +s 𝑦) = (𝐶 +s 𝐴))
1817eqeq2d 2777 . . . . . . . . . . . . 13 (𝑦 = 𝐴 → (𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐶 +s 𝐴)))
1918rexsng 4637 . . . . . . . . . . . 12 (𝐴 ∈ No → (∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐶 +s 𝐴)))
202, 19syl 18 . . . . . . . . . . 11 (𝜑 → (∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐶 +s 𝐴)))
217, 2addscomd 28412 . . . . . . . . . . . 12 (𝜑 → (𝐶 +s 𝐴) = (𝐴 +s 𝐶))
2221eqeq2d 2777 . . . . . . . . . . 11 (𝜑 → (𝑥 = (𝐶 +s 𝐴) ↔ 𝑥 = (𝐴 +s 𝐶)))
2320, 22bitrd 282 . . . . . . . . . 10 (𝜑 → (∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐴 +s 𝐶)))
2423abbidv 2832 . . . . . . . . 9 (𝜑 → {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦)} = {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)})
2516, 24uneq12d 4170 . . . . . . . 8 (𝜑 → ({𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦)}) = ({𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)} ∪ {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)}))
26 df-sn 4588 . . . . . . . . 9 {(𝐴 +s 𝐶)} = {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)}
27 unidm 4158 . . . . . . . . 9 ({𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)} ∪ {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)}) = {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)}
2826, 27eqtr4i 2792 . . . . . . . 8 {(𝐴 +s 𝐶)} = ({𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)} ∪ {𝑥 ∣ 𝑥 = (𝐴 +s 𝐶)})
2925, 28eqtr4di 2819 . . . . . . 7 (𝜑 → ({𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦)}) = {(𝐴 +s 𝐶)})
30 oveq1 7457 . . . . . . . . . . . . 13 (𝑦 = 𝐵 → (𝑦 +s 𝐶) = (𝐵 +s 𝐶))
3130eqeq2d 2777 . . . . . . . . . . . 12 (𝑦 = 𝐵 → (𝑥 = (𝑦 +s 𝐶) ↔ 𝑥 = (𝐵 +s 𝐶)))
3231rexsng 4637 . . . . . . . . . . 11 (𝐵 ∈ No → (∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶) ↔ 𝑥 = (𝐵 +s 𝐶)))
333, 32syl 18 . . . . . . . . . 10 (𝜑 → (∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶) ↔ 𝑥 = (𝐵 +s 𝐶)))
3433abbidv 2832 . . . . . . . . 9 (𝜑 → {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶)} = {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)})
35 oveq2 7458 . . . . . . . . . . . . . 14 (𝑦 = 𝐵 → (𝐶 +s 𝑦) = (𝐶 +s 𝐵))
3635eqeq2d 2777 . . . . . . . . . . . . 13 (𝑦 = 𝐵 → (𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐶 +s 𝐵)))
3736rexsng 4637 . . . . . . . . . . . 12 (𝐵 ∈ No → (∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐶 +s 𝐵)))
383, 37syl 18 . . . . . . . . . . 11 (𝜑 → (∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐶 +s 𝐵)))
397, 3addscomd 28412 . . . . . . . . . . . 12 (𝜑 → (𝐶 +s 𝐵) = (𝐵 +s 𝐶))
4039eqeq2d 2777 . . . . . . . . . . 11 (𝜑 → (𝑥 = (𝐶 +s 𝐵) ↔ 𝑥 = (𝐵 +s 𝐶)))
4138, 40bitrd 282 . . . . . . . . . 10 (𝜑 → (∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦) ↔ 𝑥 = (𝐵 +s 𝐶)))
4241abbidv 2832 . . . . . . . . 9 (𝜑 → {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦)} = {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)})
4334, 42uneq12d 4170 . . . . . . . 8 (𝜑 → ({𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦)}) = ({𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)} ∪ {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)}))
44 df-sn 4588 . . . . . . . . 9 {(𝐵 +s 𝐶)} = {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)}
45 unidm 4158 . . . . . . . . 9 ({𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)} ∪ {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)}) = {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)}
4644, 45eqtr4i 2792 . . . . . . . 8 {(𝐵 +s 𝐶)} = ({𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)} ∪ {𝑥 ∣ 𝑥 = (𝐵 +s 𝐶)})
4743, 46eqtr4di 2819 . . . . . . 7 (𝜑 → ({𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦)}) = {(𝐵 +s 𝐶)})
4829, 47oveq12d 7468 . . . . . 6 (𝜑 → (({𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦)})) = ({(𝐴 +s 𝐶)} |s {(𝐵 +s 𝐶)}))
49 2no 28864 . . . . . . . . . 10 2s ∈ No
5049a1i 11 . . . . . . . . 9 (𝜑 → 2s ∈ No)
5150, 2mulscld 28580 . . . . . . . 8 (𝜑 → (2s ·s 𝐴) ∈ No)
5250, 3mulscld 28580 . . . . . . . 8 (𝜑 → (2s ·s 𝐵) ∈ No)
53 2nns 28863 . . . . . . . . . . 11 2s ∈ ℕs
54 nnsgt0 28784 . . . . . . . . . . 11 (2s ∈ ℕs → 0s <s 2s)
5553, 54mp1i 14 . . . . . . . . . 10 (𝜑 → 0s <s 2s)
562, 3, 50, 55ltmuls2d 28617 . . . . . . . . 9 (𝜑 → (𝐴 <s 𝐵 ↔ (2s ·s 𝐴) <s (2s ·s 𝐵)))
574, 56mpbid 235 . . . . . . . 8 (𝜑 → (2s ·s 𝐴) <s (2s ·s 𝐵))
5851, 52, 57sltssn 28215 . . . . . . 7 (𝜑 → {(2s ·s 𝐴)} <<s {(2s ·s 𝐵)})
59 no2times 28862 . . . . . . . . . 10 (𝐴 ∈ No → (2s ·s 𝐴) = (𝐴 +s 𝐴))
602, 59syl 18 . . . . . . . . 9 (𝜑 → (2s ·s 𝐴) = (𝐴 +s 𝐴))
61 lesid 28183 . . . . . . . . . . . . . . 15 (𝐴 ∈ No → 𝐴 ≤s 𝐴)
622, 61syl 18 . . . . . . . . . . . . . 14 (𝜑 → 𝐴 ≤s 𝐴)
63 breq2 5111 . . . . . . . . . . . . . . . 16 (𝑥 = 𝐴 → (𝐴 ≤s 𝑥 ↔ 𝐴 ≤s 𝐴))
6463rexsng 4637 . . . . . . . . . . . . . . 15 (𝐴 ∈ No → (∃𝑥 ∈ {𝐴}𝐴 ≤s 𝑥 ↔ 𝐴 ≤s 𝐴))
652, 64syl 18 . . . . . . . . . . . . . 14 (𝜑 → (∃𝑥 ∈ {𝐴}𝐴 ≤s 𝑥 ↔ 𝐴 ≤s 𝐴))
6662, 65mpbird 260 . . . . . . . . . . . . 13 (𝜑 → ∃𝑥 ∈ {𝐴}𝐴 ≤s 𝑥)
6766orcd 887 . . . . . . . . . . . 12 (𝜑 → (∃𝑥 ∈ {𝐴}𝐴 ≤s 𝑥 ∨ ∃𝑦 ∈ (R‘𝐴)𝑦 ≤s 𝐶))
68 lltr 28307 . . . . . . . . . . . . . 14 (L‘𝐴) <<s (R‘𝐴)
6968a1i 11 . . . . . . . . . . . . 13 (𝜑 → (L‘𝐴) <<s (R‘𝐴))
70 lrcut 28349 . . . . . . . . . . . . . . 15 (𝐴 ∈ No → ((L‘𝐴) |s (R‘𝐴)) = 𝐴)
712, 70syl 18 . . . . . . . . . . . . . 14 (𝜑 → ((L‘𝐴) |s (R‘𝐴)) = 𝐴)
7271eqcomd 2772 . . . . . . . . . . . . 13 (𝜑 → 𝐴 = ((L‘𝐴) |s (R‘𝐴)))
7369, 5, 72, 10ltsrecd 28247 . . . . . . . . . . . 12 (𝜑 → (𝐴 <s 𝐶 ↔ (∃𝑥 ∈ {𝐴}𝐴 ≤s 𝑥 ∨ ∃𝑦 ∈ (R‘𝐴)𝑦 ≤s 𝐶)))
7467, 73mpbird 260 . . . . . . . . . . 11 (𝜑 → 𝐴 <s 𝐶)
752, 7, 74ltlesd 28189 . . . . . . . . . 10 (𝜑 → 𝐴 ≤s 𝐶)
762, 7, 2leadds2d 28441 . . . . . . . . . 10 (𝜑 → (𝐴 ≤s 𝐶 ↔ (𝐴 +s 𝐴) ≤s (𝐴 +s 𝐶)))
7775, 76mpbid 235 . . . . . . . . 9 (𝜑 → (𝐴 +s 𝐴) ≤s (𝐴 +s 𝐶))
7860, 77eqbrtrd 5132 . . . . . . . 8 (𝜑 → (2s ·s 𝐴) ≤s (𝐴 +s 𝐶))
79 ovex 7483 . . . . . . . . . 10 (2s ·s 𝐴) ∈ V
80 breq1 5110 . . . . . . . . . . 11 (𝑥 = (2s ·s 𝐴) → (𝑥 ≤s 𝑦 ↔ (2s ·s 𝐴) ≤s 𝑦))
8180rexbidv 3193 . . . . . . . . . 10 (𝑥 = (2s ·s 𝐴) → (∃𝑦 ∈ {(𝐴 +s 𝐶)}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(𝐴 +s 𝐶)} (2s ·s 𝐴) ≤s 𝑦))
8279, 81ralsn 4642 . . . . . . . . 9 (∀𝑥 ∈ {(2s ·s 𝐴)}∃𝑦 ∈ {(𝐴 +s 𝐶)}𝑥 ≤s 𝑦 ↔ ∃𝑦 ∈ {(𝐴 +s 𝐶)} (2s ·s 𝐴) ≤s 𝑦)
83 ovex 7483 . . . . . . . . . 10 (𝐴 +s 𝐶) ∈ V
84 breq2 5111 . . . . . . . . . 10 (𝑦 = (𝐴 +s 𝐶) → ((2s ·s 𝐴) ≤s 𝑦 ↔ (2s ·s 𝐴) ≤s (𝐴 +s 𝐶)))
8583, 84rexsn 4643 . . . . . . . . 9 (∃𝑦 ∈ {(𝐴 +s 𝐶)} (2s ·s 𝐴) ≤s 𝑦 ↔ (2s ·s 𝐴) ≤s (𝐴 +s 𝐶))
8682, 85bitri 278 . . . . . . . 8 (∀𝑥 ∈ {(2s ·s 𝐴)}∃𝑦 ∈ {(𝐴 +s 𝐶)}𝑥 ≤s 𝑦 ↔ (2s ·s 𝐴) ≤s (𝐴 +s 𝐶))
8778, 86sylibr 237 . . . . . . 7 (𝜑 → ∀𝑥 ∈ {(2s ·s 𝐴)}∃𝑦 ∈ {(𝐴 +s 𝐶)}𝑥 ≤s 𝑦)
88 lesid 28183 . . . . . . . . . . . . . . 15 (𝐵 ∈ No → 𝐵 ≤s 𝐵)
893, 88syl 18 . . . . . . . . . . . . . 14 (𝜑 → 𝐵 ≤s 𝐵)
90 breq1 5110 . . . . . . . . . . . . . . . 16 (𝑦 = 𝐵 → (𝑦 ≤s 𝐵 ↔ 𝐵 ≤s 𝐵))
9190rexsng 4637 . . . . . . . . . . . . . . 15 (𝐵 ∈ No → (∃𝑦 ∈ {𝐵}𝑦 ≤s 𝐵 ↔ 𝐵 ≤s 𝐵))
923, 91syl 18 . . . . . . . . . . . . . 14 (𝜑 → (∃𝑦 ∈ {𝐵}𝑦 ≤s 𝐵 ↔ 𝐵 ≤s 𝐵))
9389, 92mpbird 260 . . . . . . . . . . . . 13 (𝜑 → ∃𝑦 ∈ {𝐵}𝑦 ≤s 𝐵)
9493olcd 888 . . . . . . . . . . . 12 (𝜑 → (∃𝑥 ∈ (L‘𝐵)𝐶 ≤s 𝑥 ∨ ∃𝑦 ∈ {𝐵}𝑦 ≤s 𝐵))
95 lltr 28307 . . . . . . . . . . . . . 14 (L‘𝐵) <<s (R‘𝐵)
9695a1i 11 . . . . . . . . . . . . 13 (𝜑 → (L‘𝐵) <<s (R‘𝐵))
97 lrcut 28349 . . . . . . . . . . . . . . 15 (𝐵 ∈ No → ((L‘𝐵) |s (R‘𝐵)) = 𝐵)
983, 97syl 18 . . . . . . . . . . . . . 14 (𝜑 → ((L‘𝐵) |s (R‘𝐵)) = 𝐵)
9998eqcomd 2772 . . . . . . . . . . . . 13 (𝜑 → 𝐵 = ((L‘𝐵) |s (R‘𝐵)))
1005, 96, 10, 99ltsrecd 28247 . . . . . . . . . . . 12 (𝜑 → (𝐶 <s 𝐵 ↔ (∃𝑥 ∈ (L‘𝐵)𝐶 ≤s 𝑥 ∨ ∃𝑦 ∈ {𝐵}𝑦 ≤s 𝐵)))
10194, 100mpbird 260 . . . . . . . . . . 11 (𝜑 → 𝐶 <s 𝐵)
1027, 3, 101ltlesd 28189 . . . . . . . . . 10 (𝜑 → 𝐶 ≤s 𝐵)
1037, 3, 3leadds2d 28441 . . . . . . . . . 10 (𝜑 → (𝐶 ≤s 𝐵 ↔ (𝐵 +s 𝐶) ≤s (𝐵 +s 𝐵)))
104102, 103mpbid 235 . . . . . . . . 9 (𝜑 → (𝐵 +s 𝐶) ≤s (𝐵 +s 𝐵))
105 no2times 28862 . . . . . . . . . 10 (𝐵 ∈ No → (2s ·s 𝐵) = (𝐵 +s 𝐵))
1063, 105syl 18 . . . . . . . . 9 (𝜑 → (2s ·s 𝐵) = (𝐵 +s 𝐵))
107104, 106breqtrrd 5138 . . . . . . . 8 (𝜑 → (𝐵 +s 𝐶) ≤s (2s ·s 𝐵))
108 ovex 7483 . . . . . . . . . 10 (2s ·s 𝐵) ∈ V
109 breq2 5111 . . . . . . . . . . 11 (𝑥 = (2s ·s 𝐵) → (𝑦 ≤s 𝑥 ↔ 𝑦 ≤s (2s ·s 𝐵)))
110109rexbidv 3193 . . . . . . . . . 10 (𝑥 = (2s ·s 𝐵) → (∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s 𝑥 ↔ ∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s (2s ·s 𝐵)))
111108, 110ralsn 4642 . . . . . . . . 9 (∀𝑥 ∈ {(2s ·s 𝐵)}∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s 𝑥 ↔ ∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s (2s ·s 𝐵))
112 ovex 7483 . . . . . . . . . 10 (𝐵 +s 𝐶) ∈ V
113 breq1 5110 . . . . . . . . . 10 (𝑦 = (𝐵 +s 𝐶) → (𝑦 ≤s (2s ·s 𝐵) ↔ (𝐵 +s 𝐶) ≤s (2s ·s 𝐵)))
114112, 113rexsn 4643 . . . . . . . . 9 (∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s (2s ·s 𝐵) ↔ (𝐵 +s 𝐶) ≤s (2s ·s 𝐵))
115111, 114bitri 278 . . . . . . . 8 (∀𝑥 ∈ {(2s ·s 𝐵)}∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s 𝑥 ↔ (𝐵 +s 𝐶) ≤s (2s ·s 𝐵))
116107, 115sylibr 237 . . . . . . 7 (𝜑 → ∀𝑥 ∈ {(2s ·s 𝐵)}∃𝑦 ∈ {(𝐵 +s 𝐶)}𝑦 ≤s 𝑥)
1172, 7addscld 28425 . . . . . . . . 9 (𝜑 → (𝐴 +s 𝐶) ∈ No)
1182, 3addscld 28425 . . . . . . . . 9 (𝜑 → (𝐴 +s 𝐵) ∈ No)
1197, 3, 2ltadds2d 28442 . . . . . . . . . 10 (𝜑 → (𝐶 <s 𝐵 ↔ (𝐴 +s 𝐶) <s (𝐴 +s 𝐵)))
120101, 119mpbid 235 . . . . . . . . 9 (𝜑 → (𝐴 +s 𝐶) <s (𝐴 +s 𝐵))
121117, 118, 120sltssn 28215 . . . . . . . 8 (𝜑 → {(𝐴 +s 𝐶)} <<s {(𝐴 +s 𝐵)})
122 halfcut.4 . . . . . . . . 9 (𝜑 → ({(2s ·s 𝐴)} |s {(2s ·s 𝐵)}) = (𝐴 +s 𝐵))
123122sneqd 4595 . . . . . . . 8 (𝜑 → {({(2s ·s 𝐴)} |s {(2s ·s 𝐵)})} = {(𝐴 +s 𝐵)})
124121, 123breqtrrd 5138 . . . . . . 7 (𝜑 → {(𝐴 +s 𝐶)} <<s {({(2s ·s 𝐴)} |s {(2s ·s 𝐵)})})
1253, 7addscld 28425 . . . . . . . . 9 (𝜑 → (𝐵 +s 𝐶) ∈ No)
1263, 2addscomd 28412 . . . . . . . . . 10 (𝜑 → (𝐵 +s 𝐴) = (𝐴 +s 𝐵))
1272, 7, 3ltadds2d 28442 . . . . . . . . . . 11 (𝜑 → (𝐴 <s 𝐶 ↔ (𝐵 +s 𝐴) <s (𝐵 +s 𝐶)))
12874, 127mpbid 235 . . . . . . . . . 10 (𝜑 → (𝐵 +s 𝐴) <s (𝐵 +s 𝐶))
129126, 128eqbrtrrd 5134 . . . . . . . . 9 (𝜑 → (𝐴 +s 𝐵) <s (𝐵 +s 𝐶))
130118, 125, 129sltssn 28215 . . . . . . . 8 (𝜑 → {(𝐴 +s 𝐵)} <<s {(𝐵 +s 𝐶)})
131123, 130eqbrtrd 5132 . . . . . . 7 (𝜑 → {({(2s ·s 𝐴)} |s {(2s ·s 𝐵)})} <<s {(𝐵 +s 𝐶)})
13258, 87, 116, 124, 131cofcut1d 28366 . . . . . 6 (𝜑 → ({(2s ·s 𝐴)} |s {(2s ·s 𝐵)}) = ({(𝐴 +s 𝐶)} |s {(𝐵 +s 𝐶)}))
13348, 132, 1223eqtr2d 2807 . . . . 5 (𝜑 → (({𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐴}𝑥 = (𝐶 +s 𝑦)}) |s ({𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝑦 +s 𝐶)} ∪ {𝑥 ∣ ∃𝑦 ∈ {𝐵}𝑥 = (𝐶 +s 𝑦)})) = (𝐴 +s 𝐵))
13411, 133eqtrd 2801 . . . 4 (𝜑 → (𝐶 +s 𝐶) = (𝐴 +s 𝐵))
1359, 134eqtrd 2801 . . 3 (𝜑 → (2s ·s 𝐶) = (𝐴 +s 𝐵))
136 2ne0s 28865 . . . . 5 2s ≠ 0s
137136a1i 11 . . . 4 (𝜑 → 2s ≠ 0s )
138 0no 28254 . . . . . . . . . 10 0s ∈ No
139138a1i 11 . . . . . . . . 9 (⊤ → 0s ∈ No)
140 1no 28255 . . . . . . . . . 10 1s ∈ No
141140a1i 11 . . . . . . . . 9 (⊤ → 1s ∈ No)
142 0lt1s 28257 . . . . . . . . . 10 0s <s 1s
143142a1i 11 . . . . . . . . 9 (⊤ → 0s <s 1s )
144139, 141, 143sltssn 28215 . . . . . . . 8 (⊤ → { 0s } <<s { 1s })
145144cutscld 28228 . . . . . . 7 (⊤ → ({ 0s } |s { 1s }) ∈ No)
146145mptru 1579 . . . . . 6 ({ 0s } |s { 1s }) ∈ No
147 twocut 28868 . . . . . 6 (2s ·s ({ 0s } |s { 1s })) = 1s
148 oveq2 7458 . . . . . . . 8 (𝑥 = ({ 0s } |s { 1s }) → (2s ·s 𝑥) = (2s ·s ({ 0s } |s { 1s })))
149148eqeq1d 2768 . . . . . . 7 (𝑥 = ({ 0s } |s { 1s }) → ((2s ·s 𝑥) = 1s ↔ (2s ·s ({ 0s } |s { 1s })) = 1s ))
150149rspcev 3579 . . . . . 6 ((({ 0s } |s { 1s }) ∈ No ∧ (2s ·s ({ 0s } |s { 1s })) = 1s ) → ∃𝑥 ∈ No (2s ·s 𝑥) = 1s )
151146, 147, 150mp2an 705 . . . . 5 ∃𝑥 ∈ No (2s ·s 𝑥) = 1s
152151a1i 11 . . . 4 (𝜑 → ∃𝑥 ∈ No (2s ·s 𝑥) = 1s )
153118, 7, 50, 137, 152divmulswd 28639 . . 3 (𝜑 → (((𝐴 +s 𝐵) /su 2s) = 𝐶 ↔ (2s ·s 𝐶) = (𝐴 +s 𝐵)))
154135, 153mpbird 260 . 2 (𝜑 → ((𝐴 +s 𝐵) /su 2s) = 𝐶)
155154eqcomd 2772 1 (𝜑 → 𝐶 = ((𝐴 +s 𝐵) /su 2s))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∨ wo 861   = wceq 1572  ⊤wtru 1573   ∈ wcel 2150  {cab 2744   ≠ wne 2962  ∀wral 3083  ∃wrex 3093   ∪ cun 4151  {csn 4587   class class class wbr 5107  ‘cfv 6565  (class class class)co 7450  Nocsur 28056   <s clts 28057   ≤s cles 28160   <<s cslts 28202   |s ccuts 28204   0s c0s 28250   1s c1s 28251  Lcleft 28270  Rcright 28271   +s cadds 28404   ·s cmuls 28551   /su cdivs 28632  ℕscnns 28758  2sc2s 28855
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-rep 5237  ax-sep 5254  ax-nul 5265  ax-pow 5333  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1105  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-nfc 2916  df-ne 2963  df-ral 3084  df-rex 3094  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-tp 4592  df-op 4840  df-ot 4863  df-uni 4872  df-int 4912  df-iun 4957  df-br 5108  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5552  df-eprel 5557  df-po 5565  df-so 5566  df-fr 5610  df-se 5611  df-we 5612  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-pred 6329  df-ord 6390  df-on 6391  df-lim 6392  df-suc 6393  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-riota 7407  df-ov 7453  df-oprab 7454  df-mpo 7455  df-om 7911  df-1st 8034  df-2nd 8035  df-frecs 8336  df-wrecs 8367  df-recs 8416  df-rdg 8455  df-1o 8513  df-2o 8514  df-nadd 8712  df-no 28059  df-lts 28060  df-bday 28061  df-les 28161  df-slts 28203  df-cuts 28205  df-0s 28252  df-1s 28253  df-made 28272  df-old 28273  df-left 28275  df-right 28276  df-norec 28383  df-norec2 28394  df-adds 28405  df-negs 28466  df-subs 28467  df-muls 28552  df-divs 28633  df-n0s 28759  df-nns 28760  df-2s 28856
This theorem is used by:  addhalfcut  28904  pw2cut  28905
  Copyright terms: Public domain W3C validator