Metamath Proof Explorer


Theorem modirr

Description: A number modulo an irrational multiple of it is nonzero. (Contributed by NM, 11-Nov-2008)

Ref Expression
Assertion modirr ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ A B ∈ ℝ ∖ ℚ → A mod B ≠ 0

Proof

Step Hyp Ref Expression
1 eldif ⊢ A B ∈ ℝ ∖ ℚ ↔ A B ∈ ℝ ∧ ¬ A B ∈ ℚ
2 modval ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B = A − B ⁢ A B
3 2 eqeq1d ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B = 0 ↔ A − B ⁢ A B = 0
4 recn ⊢ A ∈ ℝ → A ∈ ℂ
5 4 adantr ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A ∈ ℂ
6 rpre ⊢ B ∈ ℝ + → B ∈ ℝ
7 6 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → B ∈ ℝ
8 refldivcl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℝ
9 7 8 remulcld ⊢ A ∈ ℝ ∧ B ∈ ℝ + → B ⁢ A B ∈ ℝ
10 9 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → B ⁢ A B ∈ ℂ
11 5 10 subeq0ad ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A − B ⁢ A B = 0 ↔ A = B ⁢ A B
12 rerpdivcl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℝ
13 reflcl ⊢ A B ∈ ℝ → A B ∈ ℝ
14 13 recnd ⊢ A B ∈ ℝ → A B ∈ ℂ
15 12 14 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℂ
16 rpcnne0 ⊢ B ∈ ℝ + → B ∈ ℂ ∧ B ≠ 0
17 16 adantl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → B ∈ ℂ ∧ B ≠ 0
18 divmul2 ⊢ A ∈ ℂ ∧ A B ∈ ℂ ∧ B ∈ ℂ ∧ B ≠ 0 → A B = A B ↔ A = B ⁢ A B
19 5 15 17 18 syl3anc ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B = A B ↔ A = B ⁢ A B
20 eqcom ⊢ A B = A B ↔ A B = A B
21 19 20 bitr3di ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A = B ⁢ A B ↔ A B = A B
22 3 11 21 3bitrd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B = 0 ↔ A B = A B
23 flidz ⊢ A B ∈ ℝ → A B = A B ↔ A B ∈ ℤ
24 zq ⊢ A B ∈ ℤ → A B ∈ ℚ
25 23 24 biimtrdi ⊢ A B ∈ ℝ → A B = A B → A B ∈ ℚ
26 12 25 syl ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B = A B → A B ∈ ℚ
27 22 26 sylbid ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A mod B = 0 → A B ∈ ℚ
28 27 necon3bd ⊢ A ∈ ℝ ∧ B ∈ ℝ + → ¬ A B ∈ ℚ → A mod B ≠ 0
29 28 adantld ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℝ ∧ ¬ A B ∈ ℚ → A mod B ≠ 0
30 1 29 biimtrid ⊢ A ∈ ℝ ∧ B ∈ ℝ + → A B ∈ ℝ ∖ ℚ → A mod B ≠ 0
31 30 3impia ⊢ A ∈ ℝ ∧ B ∈ ℝ + ∧ A B ∈ ℝ ∖ ℚ → A mod B ≠ 0