Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eucalgval2 | Structured version Visualization version GIF version |
Description: The value of the step function 𝐸 for Euclid's Algorithm on an ordered pair. (Contributed by Paul Chapman, 31-Mar-2011.) (Revised by Mario Carneiro, 28-May-2014.) |
Ref | Expression |
---|---|
eucalgval.1 | ⊢ 𝐸 = (𝑥 ∈ ℕ0, 𝑦 ∈ ℕ0 ↦ if(𝑦 = 0, 〈𝑥, 𝑦〉, 〈𝑦, (𝑥 mod 𝑦)〉)) |
Ref | Expression |
---|---|
eucalgval2 | ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀𝐸𝑁) = if(𝑁 = 0, 〈𝑀, 𝑁〉, 〈𝑁, (𝑀 mod 𝑁)〉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 476 | . . . 4 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → 𝑦 = 𝑁) | |
2 | 1 | eqeq1d 2612 | . . 3 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → (𝑦 = 0 ↔ 𝑁 = 0)) |
3 | opeq12 4342 | . . 3 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → 〈𝑥, 𝑦〉 = 〈𝑀, 𝑁〉) | |
4 | oveq12 6558 | . . . 4 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → (𝑥 mod 𝑦) = (𝑀 mod 𝑁)) | |
5 | 1, 4 | opeq12d 4348 | . . 3 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → 〈𝑦, (𝑥 mod 𝑦)〉 = 〈𝑁, (𝑀 mod 𝑁)〉) |
6 | 2, 3, 5 | ifbieq12d 4063 | . 2 ⊢ ((𝑥 = 𝑀 ∧ 𝑦 = 𝑁) → if(𝑦 = 0, 〈𝑥, 𝑦〉, 〈𝑦, (𝑥 mod 𝑦)〉) = if(𝑁 = 0, 〈𝑀, 𝑁〉, 〈𝑁, (𝑀 mod 𝑁)〉)) |
7 | eucalgval.1 | . 2 ⊢ 𝐸 = (𝑥 ∈ ℕ0, 𝑦 ∈ ℕ0 ↦ if(𝑦 = 0, 〈𝑥, 𝑦〉, 〈𝑦, (𝑥 mod 𝑦)〉)) | |
8 | opex 4859 | . . 3 ⊢ 〈𝑀, 𝑁〉 ∈ V | |
9 | opex 4859 | . . 3 ⊢ 〈𝑁, (𝑀 mod 𝑁)〉 ∈ V | |
10 | 8, 9 | ifex 4106 | . 2 ⊢ if(𝑁 = 0, 〈𝑀, 𝑁〉, 〈𝑁, (𝑀 mod 𝑁)〉) ∈ V |
11 | 6, 7, 10 | ovmpt2a 6689 | 1 ⊢ ((𝑀 ∈ ℕ0 ∧ 𝑁 ∈ ℕ0) → (𝑀𝐸𝑁) = if(𝑁 = 0, 〈𝑀, 𝑁〉, 〈𝑁, (𝑀 mod 𝑁)〉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ifcif 4036 〈cop 4131 (class class class)co 6549 ↦ cmpt2 6551 0cc0 9815 ℕ0cn0 11169 mod cmo 12530 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pr 4833 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-iota 5768 df-fun 5806 df-fv 5812 df-ov 6552 df-oprab 6553 df-mpt2 6554 |
This theorem is referenced by: eucalgval 15133 |
Copyright terms: Public domain | W3C validator |