ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-gcd GIF version

Definition df-gcd 12750
Description: Define the gcd operator. For example, (-6 gcd 9) = 3 (ex-gcd 16911). (Contributed by Paul Chapman, 21-Mar-2011.)
Assertion
Ref Expression
df-gcd gcd = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∧ 𝑦 = 0), 0, sup({𝑛 ∈ ℤ ∣ (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)}, ℝ, < )))
Distinct variable group:   𝑥,𝑛,𝑦

Detailed syntax breakdown of Definition df-gcd
StepHypRef Expression
1 cgcd 12749 . 2 class gcd
2 vx . . 3 setvar 𝑥
3 vy . . 3 setvar 𝑦
4 cz 9649 . . 3 class ℤ
52cv 1401 . . . . . 6 class 𝑥
6 cc0 8180 . . . . . 6 class 0
75, 6wceq 1402 . . . . 5 wff 𝑥 = 0
83cv 1401 . . . . . 6 class 𝑦
98, 6wceq 1402 . . . . 5 wff 𝑦 = 0
107, 9wa 104 . . . 4 wff (𝑥 = 0 ∧ 𝑦 = 0)
11 vn . . . . . . . . 9 setvar 𝑛
1211cv 1401 . . . . . . . 8 class 𝑛
13 cdvds 12573 . . . . . . . 8 class ∥
1412, 5, 13wbr 4130 . . . . . . 7 wff 𝑛 ∥ 𝑥
1512, 8, 13wbr 4130 . . . . . . 7 wff 𝑛 ∥ 𝑦
1614, 15wa 104 . . . . . 6 wff (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)
1716, 11, 4crab 2532 . . . . 5 class {𝑛 ∈ ℤ ∣ (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)}
18 cr 8179 . . . . 5 class ℝ
19 clt 8361 . . . . 5 class <
2017, 18, 19csup 7323 . . . 4 class sup({𝑛 ∈ ℤ ∣ (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)}, ℝ, < )
2110, 6, 20cif 3638 . . 3 class if((𝑥 = 0 ∧ 𝑦 = 0), 0, sup({𝑛 ∈ ℤ ∣ (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)}, ℝ, < ))
222, 3, 4, 4, 21cmpo 6087 . 2 class (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∧ 𝑦 = 0), 0, sup({𝑛 ∈ ℤ ∣ (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)}, ℝ, < )))
231, 22wceq 1402 1 wff gcd = (𝑥 ∈ ℤ, 𝑦 ∈ ℤ ↦ if((𝑥 = 0 ∧ 𝑦 = 0), 0, sup({𝑛 ∈ ℤ ∣ (𝑛 ∥ 𝑥 ∧ 𝑛 ∥ 𝑦)}, ℝ, < )))
Colors of variables:    wff set class
This definition is used by:  gcdval  12755  gcdf  12768
  Copyright terms: Public domain W3C validator