Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > reapmul1lem | GIF version |
Description: Lemma for reapmul1 8514. (Contributed by Jim Kingdon, 8-Feb-2020.) |
Ref | Expression |
---|---|
reapmul1lem | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 # 𝐵 ↔ (𝐴 · 𝐶) # (𝐵 · 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltmul1 8511 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 · 𝐶) < (𝐵 · 𝐶))) | |
2 | ltmul1 8511 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 ↔ (𝐵 · 𝐶) < (𝐴 · 𝐶))) | |
3 | 2 | 3com12 1202 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 ↔ (𝐵 · 𝐶) < (𝐴 · 𝐶))) |
4 | 1, 3 | orbi12d 788 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 < 𝐵 ∨ 𝐵 < 𝐴) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) ∨ (𝐵 · 𝐶) < (𝐴 · 𝐶)))) |
5 | reaplt 8507 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 # 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) | |
6 | 5 | 3adant3 1012 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 # 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐵 < 𝐴))) |
7 | simp1 992 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐴 ∈ ℝ) | |
8 | simp3l 1020 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐶 ∈ ℝ) | |
9 | 7, 8 | remulcld 7950 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 · 𝐶) ∈ ℝ) |
10 | simp2 993 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐵 ∈ ℝ) | |
11 | 10, 8 | remulcld 7950 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 · 𝐶) ∈ ℝ) |
12 | reaplt 8507 | . . 3 ⊢ (((𝐴 · 𝐶) ∈ ℝ ∧ (𝐵 · 𝐶) ∈ ℝ) → ((𝐴 · 𝐶) # (𝐵 · 𝐶) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) ∨ (𝐵 · 𝐶) < (𝐴 · 𝐶)))) | |
13 | 9, 11, 12 | syl2anc 409 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) # (𝐵 · 𝐶) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) ∨ (𝐵 · 𝐶) < (𝐴 · 𝐶)))) |
14 | 4, 6, 13 | 3bitr4d 219 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 # 𝐵 ↔ (𝐴 · 𝐶) # (𝐵 · 𝐶))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∨ wo 703 ∧ w3a 973 ∈ wcel 2141 class class class wbr 3989 (class class class)co 5853 ℝcr 7773 0cc0 7774 · cmul 7779 < clt 7954 # cap 8500 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-13 2143 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pow 4160 ax-pr 4194 ax-un 4418 ax-setind 4521 ax-cnex 7865 ax-resscn 7866 ax-1cn 7867 ax-1re 7868 ax-icn 7869 ax-addcl 7870 ax-addrcl 7871 ax-mulcl 7872 ax-mulrcl 7873 ax-addcom 7874 ax-mulcom 7875 ax-addass 7876 ax-mulass 7877 ax-distr 7878 ax-i2m1 7879 ax-0lt1 7880 ax-1rid 7881 ax-0id 7882 ax-rnegex 7883 ax-precex 7884 ax-cnre 7885 ax-pre-ltirr 7886 ax-pre-lttrn 7888 ax-pre-apti 7889 ax-pre-ltadd 7890 ax-pre-mulgt0 7891 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-nel 2436 df-ral 2453 df-rex 2454 df-reu 2455 df-rab 2457 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3568 df-sn 3589 df-pr 3590 df-op 3592 df-uni 3797 df-br 3990 df-opab 4051 df-id 4278 df-xp 4617 df-rel 4618 df-cnv 4619 df-co 4620 df-dm 4621 df-iota 5160 df-fun 5200 df-fv 5206 df-riota 5809 df-ov 5856 df-oprab 5857 df-mpo 5858 df-pnf 7956 df-mnf 7957 df-ltxr 7959 df-sub 8092 df-neg 8093 df-reap 8494 df-ap 8501 |
This theorem is referenced by: reapmul1 8514 |
Copyright terms: Public domain | W3C validator |