Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > recvguniqlem | GIF version |
Description: Lemma for recvguniq 9593. Some of the rearrangements of the expressions. (Contributed by Jim Kingdon, 8-Aug-2021.) |
Ref | Expression |
---|---|
recvguniqlem.f | ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) |
recvguniqlem.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
recvguniqlem.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
recvguniqlem.k | ⊢ (𝜑 → 𝐾 ∈ ℕ) |
recvguniqlem.lt1 | ⊢ (𝜑 → 𝐴 < ((𝐹‘𝐾) + ((𝐴 − 𝐵) / 2))) |
recvguniqlem.lt2 | ⊢ (𝜑 → (𝐹‘𝐾) < (𝐵 + ((𝐴 − 𝐵) / 2))) |
Ref | Expression |
---|---|
recvguniqlem | ⊢ (𝜑 → ⊥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | recvguniqlem.a | . . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | recvguniqlem.f | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ) | |
3 | recvguniqlem.k | . . . . 5 ⊢ (𝜑 → 𝐾 ∈ ℕ) | |
4 | 2, 3 | ffvelrnd 5303 | . . . 4 ⊢ (𝜑 → (𝐹‘𝐾) ∈ ℝ) |
5 | recvguniqlem.b | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
6 | 1, 5 | resubcld 7379 | . . . . 5 ⊢ (𝜑 → (𝐴 − 𝐵) ∈ ℝ) |
7 | 6 | rehalfcld 8171 | . . . 4 ⊢ (𝜑 → ((𝐴 − 𝐵) / 2) ∈ ℝ) |
8 | 4, 7 | readdcld 7055 | . . 3 ⊢ (𝜑 → ((𝐹‘𝐾) + ((𝐴 − 𝐵) / 2)) ∈ ℝ) |
9 | recvguniqlem.lt1 | . . 3 ⊢ (𝜑 → 𝐴 < ((𝐹‘𝐾) + ((𝐴 − 𝐵) / 2))) | |
10 | 5, 7 | readdcld 7055 | . . . . 5 ⊢ (𝜑 → (𝐵 + ((𝐴 − 𝐵) / 2)) ∈ ℝ) |
11 | recvguniqlem.lt2 | . . . . 5 ⊢ (𝜑 → (𝐹‘𝐾) < (𝐵 + ((𝐴 − 𝐵) / 2))) | |
12 | 4, 10, 7, 11 | ltadd1dd 7547 | . . . 4 ⊢ (𝜑 → ((𝐹‘𝐾) + ((𝐴 − 𝐵) / 2)) < ((𝐵 + ((𝐴 − 𝐵) / 2)) + ((𝐴 − 𝐵) / 2))) |
13 | 5 | recnd 7054 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
14 | 7 | recnd 7054 | . . . . . 6 ⊢ (𝜑 → ((𝐴 − 𝐵) / 2) ∈ ℂ) |
15 | 13, 14, 14 | addassd 7049 | . . . . 5 ⊢ (𝜑 → ((𝐵 + ((𝐴 − 𝐵) / 2)) + ((𝐴 − 𝐵) / 2)) = (𝐵 + (((𝐴 − 𝐵) / 2) + ((𝐴 − 𝐵) / 2)))) |
16 | 6 | recnd 7054 | . . . . . . 7 ⊢ (𝜑 → (𝐴 − 𝐵) ∈ ℂ) |
17 | 16 | 2halvesd 8170 | . . . . . 6 ⊢ (𝜑 → (((𝐴 − 𝐵) / 2) + ((𝐴 − 𝐵) / 2)) = (𝐴 − 𝐵)) |
18 | 17 | oveq2d 5528 | . . . . 5 ⊢ (𝜑 → (𝐵 + (((𝐴 − 𝐵) / 2) + ((𝐴 − 𝐵) / 2))) = (𝐵 + (𝐴 − 𝐵))) |
19 | 1 | recnd 7054 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
20 | 13, 19 | pncan3d 7325 | . . . . 5 ⊢ (𝜑 → (𝐵 + (𝐴 − 𝐵)) = 𝐴) |
21 | 15, 18, 20 | 3eqtrd 2076 | . . . 4 ⊢ (𝜑 → ((𝐵 + ((𝐴 − 𝐵) / 2)) + ((𝐴 − 𝐵) / 2)) = 𝐴) |
22 | 12, 21 | breqtrd 3788 | . . 3 ⊢ (𝜑 → ((𝐹‘𝐾) + ((𝐴 − 𝐵) / 2)) < 𝐴) |
23 | 1, 8, 1, 9, 22 | lttrd 7140 | . 2 ⊢ (𝜑 → 𝐴 < 𝐴) |
24 | 1 | ltnrd 7129 | . 2 ⊢ (𝜑 → ¬ 𝐴 < 𝐴) |
25 | 23, 24 | pm2.21fal 1264 | 1 ⊢ (𝜑 → ⊥) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ⊥wfal 1248 ∈ wcel 1393 class class class wbr 3764 ⟶wf 4898 ‘cfv 4902 (class class class)co 5512 ℝcr 6888 + caddc 6892 < clt 7060 − cmin 7182 / cdiv 7651 ℕcn 7914 2c2 7964 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 ax-cnex 6975 ax-resscn 6976 ax-1cn 6977 ax-1re 6978 ax-icn 6979 ax-addcl 6980 ax-addrcl 6981 ax-mulcl 6982 ax-mulrcl 6983 ax-addcom 6984 ax-mulcom 6985 ax-addass 6986 ax-mulass 6987 ax-distr 6988 ax-i2m1 6989 ax-1rid 6991 ax-0id 6992 ax-rnegex 6993 ax-precex 6994 ax-cnre 6995 ax-pre-ltirr 6996 ax-pre-ltwlin 6997 ax-pre-lttrn 6998 ax-pre-apti 6999 ax-pre-ltadd 7000 ax-pre-mulgt0 7001 ax-pre-mulext 7002 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-nel 2207 df-ral 2311 df-rex 2312 df-reu 2313 df-rmo 2314 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-eprel 4026 df-id 4030 df-po 4033 df-iso 4034 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-riota 5468 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-1o 6001 df-2o 6002 df-oadd 6005 df-omul 6006 df-er 6106 df-ec 6108 df-qs 6112 df-ni 6402 df-pli 6403 df-mi 6404 df-lti 6405 df-plpq 6442 df-mpq 6443 df-enq 6445 df-nqqs 6446 df-plqqs 6447 df-mqqs 6448 df-1nqqs 6449 df-rq 6450 df-ltnqqs 6451 df-enq0 6522 df-nq0 6523 df-0nq0 6524 df-plq0 6525 df-mq0 6526 df-inp 6564 df-i1p 6565 df-iplp 6566 df-iltp 6568 df-enr 6811 df-nr 6812 df-ltr 6815 df-0r 6816 df-1r 6817 df-0 6896 df-1 6897 df-r 6899 df-lt 6902 df-pnf 7062 df-mnf 7063 df-xr 7064 df-ltxr 7065 df-le 7066 df-sub 7184 df-neg 7185 df-reap 7566 df-ap 7573 df-div 7652 df-2 7973 |
This theorem is referenced by: recvguniq 9593 |
Copyright terms: Public domain | W3C validator |