Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > appdiv0nq | GIF version |
Description: Approximate division for positive rationals. This can be thought of as a variation of appdivnq 7371 in which 𝐴 is zero, although it can be stated and proved in terms of positive rationals alone, without zero as such. (Contributed by Jim Kingdon, 9-Dec-2019.) |
Ref | Expression |
---|---|
appdiv0nq | ⊢ ((𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ∃𝑚 ∈ Q (𝑚 ·Q 𝐶) <Q 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nsmallnqq 7220 | . . 3 ⊢ (𝐵 ∈ Q → ∃𝑥 ∈ Q 𝑥 <Q 𝐵) | |
2 | 1 | adantr 274 | . 2 ⊢ ((𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ∃𝑥 ∈ Q 𝑥 <Q 𝐵) |
3 | appdivnq 7371 | . . . . 5 ⊢ ((𝑥 <Q 𝐵 ∧ 𝐶 ∈ Q) → ∃𝑚 ∈ Q (𝑥 <Q (𝑚 ·Q 𝐶) ∧ (𝑚 ·Q 𝐶) <Q 𝐵)) | |
4 | simpr 109 | . . . . . 6 ⊢ ((𝑥 <Q (𝑚 ·Q 𝐶) ∧ (𝑚 ·Q 𝐶) <Q 𝐵) → (𝑚 ·Q 𝐶) <Q 𝐵) | |
5 | 4 | reximi 2529 | . . . . 5 ⊢ (∃𝑚 ∈ Q (𝑥 <Q (𝑚 ·Q 𝐶) ∧ (𝑚 ·Q 𝐶) <Q 𝐵) → ∃𝑚 ∈ Q (𝑚 ·Q 𝐶) <Q 𝐵) |
6 | 3, 5 | syl 14 | . . . 4 ⊢ ((𝑥 <Q 𝐵 ∧ 𝐶 ∈ Q) → ∃𝑚 ∈ Q (𝑚 ·Q 𝐶) <Q 𝐵) |
7 | 6 | ancoms 266 | . . 3 ⊢ ((𝐶 ∈ Q ∧ 𝑥 <Q 𝐵) → ∃𝑚 ∈ Q (𝑚 ·Q 𝐶) <Q 𝐵) |
8 | 7 | ad2ant2l 499 | . 2 ⊢ (((𝐵 ∈ Q ∧ 𝐶 ∈ Q) ∧ (𝑥 ∈ Q ∧ 𝑥 <Q 𝐵)) → ∃𝑚 ∈ Q (𝑚 ·Q 𝐶) <Q 𝐵) |
9 | 2, 8 | rexlimddv 2554 | 1 ⊢ ((𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ∃𝑚 ∈ Q (𝑚 ·Q 𝐶) <Q 𝐵) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∈ wcel 1480 ∃wrex 2417 class class class wbr 3929 (class class class)co 5774 Qcnq 7088 ·Q cmq 7091 <Q cltq 7093 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-coll 4043 ax-sep 4046 ax-nul 4054 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-iinf 4502 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-reu 2423 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-nul 3364 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-int 3772 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-tr 4027 df-eprel 4211 df-id 4215 df-po 4218 df-iso 4219 df-iord 4288 df-on 4290 df-suc 4293 df-iom 4505 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-f1 5128 df-fo 5129 df-f1o 5130 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-recs 6202 df-irdg 6267 df-1o 6313 df-oadd 6317 df-omul 6318 df-er 6429 df-ec 6431 df-qs 6435 df-ni 7112 df-pli 7113 df-mi 7114 df-lti 7115 df-plpq 7152 df-mpq 7153 df-enq 7155 df-nqqs 7156 df-plqqs 7157 df-mqqs 7158 df-1nqqs 7159 df-rq 7160 df-ltnqqs 7161 |
This theorem is referenced by: prmuloc 7374 |
Copyright terms: Public domain | W3C validator |