| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > irrmul | GIF version | ||
| Description: The product of a real which is not rational with a nonzero rational is not rational. Note that by "not rational" we mean the negation of "is rational" (whereas "irrational" is often defined to mean apart from any rational number - given excluded middle these two definitions would be equivalent). For a similar theorem with irrational in place of not rational, see irrmulap 10031. (Contributed by NM, 7-Nov-2008.) |
| Ref | Expression |
|---|---|
| irrmul | ⊢ ((𝐴 ∈ (ℝ ∖ ℚ) ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (𝐴 · 𝐵) ∈ (ℝ ∖ ℚ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eldif 3229 | . . 3 ⊢ (𝐴 ∈ (ℝ ∖ ℚ) ↔ (𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℚ)) | |
| 2 | qre 10008 | . . . . . . 7 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℝ) | |
| 3 | remulcl 8301 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ) | |
| 4 | 2, 3 | sylan2 286 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ) → (𝐴 · 𝐵) ∈ ℝ) |
| 5 | 4 | ad2ant2r 513 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → (𝐴 · 𝐵) ∈ ℝ) |
| 6 | qdivcl 10026 | . . . . . . . . . . . . 13 ⊢ (((𝐴 · 𝐵) ∈ ℚ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → ((𝐴 · 𝐵) / 𝐵) ∈ ℚ) | |
| 7 | 6 | 3expb 1235 | . . . . . . . . . . . 12 ⊢ (((𝐴 · 𝐵) ∈ ℚ ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵) / 𝐵) ∈ ℚ) |
| 8 | 7 | expcom 116 | . . . . . . . . . . 11 ⊢ ((𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → ((𝐴 · 𝐵) ∈ ℚ → ((𝐴 · 𝐵) / 𝐵) ∈ ℚ)) |
| 9 | 8 | adantl 277 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵) ∈ ℚ → ((𝐴 · 𝐵) / 𝐵) ∈ ℚ)) |
| 10 | recn 8306 | . . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 11 | 10 | 3ad2ant1 1049 | . . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → 𝐴 ∈ ℂ) |
| 12 | qcn 10017 | . . . . . . . . . . . . . 14 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℂ) | |
| 13 | 12 | 3ad2ant2 1050 | . . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℂ) |
| 14 | simp3 1030 | . . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → 𝐵 ≠ 0) | |
| 15 | 0z 9638 | . . . . . . . . . . . . . . . . 17 ⊢ 0 ∈ ℤ | |
| 16 | zq 10009 | . . . . . . . . . . . . . . . . 17 ⊢ (0 ∈ ℤ → 0 ∈ ℚ) | |
| 17 | 15, 16 | ax-mp 5 | . . . . . . . . . . . . . . . 16 ⊢ 0 ∈ ℚ |
| 18 | qapne 10022 | . . . . . . . . . . . . . . . 16 ⊢ ((𝐵 ∈ ℚ ∧ 0 ∈ ℚ) → (𝐵 # 0 ↔ 𝐵 ≠ 0)) | |
| 19 | 17, 18 | mpan2 429 | . . . . . . . . . . . . . . 15 ⊢ (𝐵 ∈ ℚ → (𝐵 # 0 ↔ 𝐵 ≠ 0)) |
| 20 | 19 | 3ad2ant2 1050 | . . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (𝐵 # 0 ↔ 𝐵 ≠ 0)) |
| 21 | 14, 20 | mpbird 167 | . . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → 𝐵 # 0) |
| 22 | 11, 13, 21 | divcanap4d 9120 | . . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → ((𝐴 · 𝐵) / 𝐵) = 𝐴) |
| 23 | 22 | 3expb 1235 | . . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵) / 𝐵) = 𝐴) |
| 24 | 23 | eleq1d 2307 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → (((𝐴 · 𝐵) / 𝐵) ∈ ℚ ↔ 𝐴 ∈ ℚ)) |
| 25 | 9, 24 | sylibd 149 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵) ∈ ℚ → 𝐴 ∈ ℚ)) |
| 26 | 25 | con3d 640 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → (¬ 𝐴 ∈ ℚ → ¬ (𝐴 · 𝐵) ∈ ℚ)) |
| 27 | 26 | ex 115 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → ((𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (¬ 𝐴 ∈ ℚ → ¬ (𝐴 · 𝐵) ∈ ℚ))) |
| 28 | 27 | com23 78 | . . . . . 6 ⊢ (𝐴 ∈ ℝ → (¬ 𝐴 ∈ ℚ → ((𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → ¬ (𝐴 · 𝐵) ∈ ℚ))) |
| 29 | 28 | imp31 256 | . . . . 5 ⊢ (((𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → ¬ (𝐴 · 𝐵) ∈ ℚ) |
| 30 | 5, 29 | jca 306 | . . . 4 ⊢ (((𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℚ) ∧ (𝐵 ∈ ℚ ∧ 𝐵 ≠ 0)) → ((𝐴 · 𝐵) ∈ ℝ ∧ ¬ (𝐴 · 𝐵) ∈ ℚ)) |
| 31 | 30 | 3impb 1230 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ ¬ 𝐴 ∈ ℚ) ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → ((𝐴 · 𝐵) ∈ ℝ ∧ ¬ (𝐴 · 𝐵) ∈ ℚ)) |
| 32 | 1, 31 | syl3an1b 1314 | . 2 ⊢ ((𝐴 ∈ (ℝ ∖ ℚ) ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → ((𝐴 · 𝐵) ∈ ℝ ∧ ¬ (𝐴 · 𝐵) ∈ ℚ)) |
| 33 | eldif 3229 | . 2 ⊢ ((𝐴 · 𝐵) ∈ (ℝ ∖ ℚ) ↔ ((𝐴 · 𝐵) ∈ ℝ ∧ ¬ (𝐴 · 𝐵) ∈ ℚ)) | |
| 34 | 32, 33 | sylibr 134 | 1 ⊢ ((𝐴 ∈ (ℝ ∖ ℚ) ∧ 𝐵 ∈ ℚ ∧ 𝐵 ≠ 0) → (𝐴 · 𝐵) ∈ (ℝ ∖ ℚ)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ≠ wne 2420 ∖ cdif 3217 class class class wbr 4128 (class class class)co 6079 ℂcc 8171 ℝcr 8172 0cc0 8173 · cmul 8178 # cap 8903 / cdiv 8996 ℤcz 9627 ℚcq 10002 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-mulrcl 8272 ax-addcom 8273 ax-mulcom 8274 ax-addass 8275 ax-mulass 8276 ax-distr 8277 ax-i2m1 8278 ax-0lt1 8279 ax-1rid 8280 ax-0id 8281 ax-rnegex 8282 ax-precex 8283 ax-cnre 8284 ax-pre-ltirr 8285 ax-pre-ltwlin 8286 ax-pre-lttrn 8287 ax-pre-apti 8288 ax-pre-ltadd 8289 ax-pre-mulgt0 8290 ax-pre-mulext 8291 |
| This theorem depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-po 4439 df-iso 4440 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-1st 6368 df-2nd 6369 df-pnf 8356 df-mnf 8357 df-xr 8358 df-ltxr 8359 df-le 8360 df-sub 8493 df-neg 8494 df-reap 8897 df-ap 8904 df-div 8997 df-inn 9288 df-n0 9547 df-z 9628 df-q 10003 |
| This theorem is referenced by: 2logb9irrALT 16059 |
| Copyright terms: Public domain | W3C validator |