| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > irraddap | GIF version | ||
| Description: The sum of an irrational number and a rational number is irrational. (Contributed by Jim Kingdon, 20-Aug-2026.) |
| Ref | Expression |
|---|---|
| irraddap | ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → ((𝐴 + 𝐵) ∈ ℝ ∧ ∀𝑞 ∈ ℚ (𝐴 + 𝐵) # 𝑞)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 531 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → 𝐴 ∈ ℝ) | |
| 2 | qre 10041 | . . . 4 ⊢ (𝐵 ∈ ℚ → 𝐵 ∈ ℝ) | |
| 3 | 2 | adantl 277 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → 𝐵 ∈ ℝ) |
| 4 | 1, 3 | readdcld 8361 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → (𝐴 + 𝐵) ∈ ℝ) |
| 5 | breq2 4135 | . . . . . . 7 ⊢ (𝑞 = (𝑟 − 𝐵) → (𝐴 # 𝑞 ↔ 𝐴 # (𝑟 − 𝐵))) | |
| 6 | simpllr 540 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → ∀𝑞 ∈ ℚ 𝐴 # 𝑞) | |
| 7 | simpr 110 | . . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝑟 ∈ ℚ) | |
| 8 | simplr 533 | . . . . . . . 8 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝐵 ∈ ℚ) | |
| 9 | qsubcl 10054 | . . . . . . . 8 ⊢ ((𝑟 ∈ ℚ ∧ 𝐵 ∈ ℚ) → (𝑟 − 𝐵) ∈ ℚ) | |
| 10 | 7, 8, 9 | syl2anc 415 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → (𝑟 − 𝐵) ∈ ℚ) |
| 11 | 5, 6, 10 | rspcdva 2934 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝐴 # (𝑟 − 𝐵)) |
| 12 | simplll 539 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝐴 ∈ ℝ) | |
| 13 | qre 10041 | . . . . . . . 8 ⊢ ((𝑟 − 𝐵) ∈ ℚ → (𝑟 − 𝐵) ∈ ℝ) | |
| 14 | 10, 13 | syl 14 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → (𝑟 − 𝐵) ∈ ℝ) |
| 15 | 8, 2 | syl 14 | . . . . . . 7 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝐵 ∈ ℝ) |
| 16 | reapadd1 8932 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ (𝑟 − 𝐵) ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 # (𝑟 − 𝐵) ↔ (𝐴 + 𝐵) # ((𝑟 − 𝐵) + 𝐵))) | |
| 17 | 12, 14, 15, 16 | syl3anc 1278 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → (𝐴 # (𝑟 − 𝐵) ↔ (𝐴 + 𝐵) # ((𝑟 − 𝐵) + 𝐵))) |
| 18 | 11, 17 | mpbid 147 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → (𝐴 + 𝐵) # ((𝑟 − 𝐵) + 𝐵)) |
| 19 | qcn 10050 | . . . . . . 7 ⊢ (𝑟 ∈ ℚ → 𝑟 ∈ ℂ) | |
| 20 | 19 | adantl 277 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝑟 ∈ ℂ) |
| 21 | 15 | recnd 8360 | . . . . . 6 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → 𝐵 ∈ ℂ) |
| 22 | 20, 21 | npcand 8648 | . . . . 5 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → ((𝑟 − 𝐵) + 𝐵) = 𝑟) |
| 23 | 18, 22 | breqtrd 4157 | . . . 4 ⊢ ((((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) ∧ 𝑟 ∈ ℚ) → (𝐴 + 𝐵) # 𝑟) |
| 24 | 23 | ralrimiva 2623 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → ∀𝑟 ∈ ℚ (𝐴 + 𝐵) # 𝑟) |
| 25 | breq2 4135 | . . . 4 ⊢ (𝑟 = 𝑞 → ((𝐴 + 𝐵) # 𝑟 ↔ (𝐴 + 𝐵) # 𝑞)) | |
| 26 | 25 | cbvralv 2786 | . . 3 ⊢ (∀𝑟 ∈ ℚ (𝐴 + 𝐵) # 𝑟 ↔ ∀𝑞 ∈ ℚ (𝐴 + 𝐵) # 𝑞) |
| 27 | 24, 26 | sylib 122 | . 2 ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → ∀𝑞 ∈ ℚ (𝐴 + 𝐵) # 𝑞) |
| 28 | 4, 27 | jca 306 | 1 ⊢ (((𝐴 ∈ ℝ ∧ ∀𝑞 ∈ ℚ 𝐴 # 𝑞) ∧ 𝐵 ∈ ℚ) → ((𝐴 + 𝐵) ∈ ℝ ∧ ∀𝑞 ∈ ℚ (𝐴 + 𝐵) # 𝑞)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 ∀wral 2528 class class class wbr 4131 (class class class)co 6088 ℂcc 8183 ℝcr 8184 + caddc 8188 − cmin 8504 # cap 8917 ℚcq 10035 |
| This proof depends on 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 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-mulrcl 8284 ax-addcom 8285 ax-mulcom 8286 ax-addass 8287 ax-mulass 8288 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-1rid 8292 ax-0id 8293 ax-rnegex 8294 ax-precex 8295 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-apti 8300 ax-pre-ltadd 8301 ax-pre-mulgt0 8302 ax-pre-mulext 8303 |
| This proof 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 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-po 4443 df-iso 4444 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-reap 8911 df-ap 8918 df-div 9011 df-inn 9314 df-n0 9575 df-z 9656 df-q 10036 |
| This theorem is used by: zprmlogbaplem2 16216 |
| Copyright terms: Public domain | W3C validator |