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

Theorem eucalgcvga 12635
Description: Once Euclid's Algorithm halts after 𝑁 steps, the second element of the state remains 0 . (Contributed by Paul Chapman, 22-Jun-2011.) (Revised by Mario Carneiro, 29-May-2014.)
Hypotheses
Ref Expression
eucalgval.1 𝐸 = (𝑥 ∈ ℕ0, 𝑦 ∈ ℕ0 ↦ if(𝑦 = 0, ⟨𝑥, 𝑦⟩, ⟨𝑦, (𝑥 mod 𝑦)⟩))
eucalg.2 𝑅 = seq0((𝐸 ∘ 1st ), (ℕ0 × {𝐴}))
eucalgcvga.3 𝑁 = (2nd𝐴)
Assertion
Ref Expression
eucalgcvga (𝐴 ∈ (ℕ0 × ℕ0) → (𝐾 ∈ (ℤ𝑁) → (2nd ‘(𝑅𝐾)) = 0))
Distinct variable groups:   𝑥,𝑦,𝑁   𝑥,𝐴,𝑦   𝑥,𝑅
Allowed substitution hints:   𝑅(𝑦)   𝐸(𝑥,𝑦)   𝐾(𝑥,𝑦)

Proof of Theorem eucalgcvga
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eucalgcvga.3 . . . . . . 7 𝑁 = (2nd𝐴)
2 xp2nd 6329 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → (2nd𝐴) ∈ ℕ0)
31, 2eqeltrid 2318 . . . . . 6 (𝐴 ∈ (ℕ0 × ℕ0) → 𝑁 ∈ ℕ0)
4 eluznn0 9833 . . . . . 6 ((𝑁 ∈ ℕ0𝐾 ∈ (ℤ𝑁)) → 𝐾 ∈ ℕ0)
53, 4sylan 283 . . . . 5 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → 𝐾 ∈ ℕ0)
6 nn0uz 9791 . . . . . . 7 0 = (ℤ‘0)
7 eucalg.2 . . . . . . 7 𝑅 = seq0((𝐸 ∘ 1st ), (ℕ0 × {𝐴}))
8 0zd 9491 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → 0 ∈ ℤ)
9 id 19 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → 𝐴 ∈ (ℕ0 × ℕ0))
10 eucalgval.1 . . . . . . . . 9 𝐸 = (𝑥 ∈ ℕ0, 𝑦 ∈ ℕ0 ↦ if(𝑦 = 0, ⟨𝑥, 𝑦⟩, ⟨𝑦, (𝑥 mod 𝑦)⟩))
1110eucalgf 12632 . . . . . . . 8 𝐸:(ℕ0 × ℕ0)⟶(ℕ0 × ℕ0)
1211a1i 9 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → 𝐸:(ℕ0 × ℕ0)⟶(ℕ0 × ℕ0))
136, 7, 8, 9, 12algrf 12622 . . . . . 6 (𝐴 ∈ (ℕ0 × ℕ0) → 𝑅:ℕ0⟶(ℕ0 × ℕ0))
1413ffvelcdmda 5782 . . . . 5 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ ℕ0) → (𝑅𝐾) ∈ (ℕ0 × ℕ0))
155, 14syldan 282 . . . 4 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → (𝑅𝐾) ∈ (ℕ0 × ℕ0))
16 fvres 5663 . . . 4 ((𝑅𝐾) ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝑅𝐾)) = (2nd ‘(𝑅𝐾)))
1715, 16syl 14 . . 3 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝑅𝐾)) = (2nd ‘(𝑅𝐾)))
18 simpl 109 . . . 4 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → 𝐴 ∈ (ℕ0 × ℕ0))
19 fvres 5663 . . . . . . . 8 (𝐴 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘𝐴) = (2nd𝐴))
2019, 1eqtr4di 2282 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘𝐴) = 𝑁)
2120fveq2d 5643 . . . . . 6 (𝐴 ∈ (ℕ0 × ℕ0) → (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)) = (ℤ𝑁))
2221eleq2d 2301 . . . . 5 (𝐴 ∈ (ℕ0 × ℕ0) → (𝐾 ∈ (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)) ↔ 𝐾 ∈ (ℤ𝑁)))
2322biimpar 297 . . . 4 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → 𝐾 ∈ (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)))
24 f2ndres 6323 . . . . 5 (2nd ↾ (ℕ0 × ℕ0)):(ℕ0 × ℕ0)⟶ℕ0
2510eucalglt 12634 . . . . . 6 (𝑧 ∈ (ℕ0 × ℕ0) → ((2nd ‘(𝐸𝑧)) ≠ 0 → (2nd ‘(𝐸𝑧)) < (2nd𝑧)))
2611ffvelcdmi 5781 . . . . . . . 8 (𝑧 ∈ (ℕ0 × ℕ0) → (𝐸𝑧) ∈ (ℕ0 × ℕ0))
27 fvres 5663 . . . . . . . 8 ((𝐸𝑧) ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) = (2nd ‘(𝐸𝑧)))
2826, 27syl 14 . . . . . . 7 (𝑧 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) = (2nd ‘(𝐸𝑧)))
2928neeq1d 2420 . . . . . 6 (𝑧 ∈ (ℕ0 × ℕ0) → (((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) ≠ 0 ↔ (2nd ‘(𝐸𝑧)) ≠ 0))
30 fvres 5663 . . . . . . 7 (𝑧 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘𝑧) = (2nd𝑧))
3128, 30breq12d 4101 . . . . . 6 (𝑧 ∈ (ℕ0 × ℕ0) → (((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) < ((2nd ↾ (ℕ0 × ℕ0))‘𝑧) ↔ (2nd ‘(𝐸𝑧)) < (2nd𝑧)))
3225, 29, 313imtr4d 203 . . . . 5 (𝑧 ∈ (ℕ0 × ℕ0) → (((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) ≠ 0 → ((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) < ((2nd ↾ (ℕ0 × ℕ0))‘𝑧)))
33 eqid 2231 . . . . 5 ((2nd ↾ (ℕ0 × ℕ0))‘𝐴) = ((2nd ↾ (ℕ0 × ℕ0))‘𝐴)
3411, 7, 24, 32, 33algcvga 12628 . . . 4 (𝐴 ∈ (ℕ0 × ℕ0) → (𝐾 ∈ (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝑅𝐾)) = 0))
3518, 23, 34sylc 62 . . 3 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝑅𝐾)) = 0)
3617, 35eqtr3d 2266 . 2 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → (2nd ‘(𝑅𝐾)) = 0)
3736ex 115 1 (𝐴 ∈ (ℕ0 × ℕ0) → (𝐾 ∈ (ℤ𝑁) → (2nd ‘(𝑅𝐾)) = 0))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1397  wcel 2202  wne 2402  ifcif 3605  {csn 3669  cop 3672   class class class wbr 4088   × cxp 4723  cres 4727  ccom 4729  wf 5322  cfv 5326  (class class class)co 6018  cmpo 6020  1st c1st 6301  2nd c2nd 6302  0cc0 8032   < clt 8214  0cn0 9402  cuz 9755   mod cmo 10585  seqcseq 10710
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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-mulrcl 8131  ax-addcom 8132  ax-mulcom 8133  ax-addass 8134  ax-mulass 8135  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-1rid 8139  ax-0id 8140  ax-rnegex 8141  ax-precex 8142  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-apti 8147  ax-pre-ltadd 8148  ax-pre-mulgt0 8149  ax-pre-mulext 8150  ax-arch 8151
This theorem depends on definitions:  df-bi 117  df-stab 838  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-ilim 4466  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-frec 6557  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-reap 8755  df-ap 8762  df-div 8853  df-inn 9144  df-n0 9403  df-z 9480  df-uz 9756  df-q 9854  df-rp 9889  df-fl 10531  df-mod 10586  df-seqfrec 10711
This theorem is referenced by:  eucalg  12636
  Copyright terms: Public domain W3C validator