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

Theorem eucalgcvga 12819
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 6394 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → (2nd𝐴) ∈ ℕ0)
31, 2eqeltrid 2325 . . . . . 6 (𝐴 ∈ (ℕ0 × ℕ0) → 𝑁 ∈ ℕ0)
4 eluznn0 9982 . . . . . 6 ((𝑁 ∈ ℕ0𝐾 ∈ (ℤ𝑁)) → 𝐾 ∈ ℕ0)
53, 4sylan 283 . . . . 5 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → 𝐾 ∈ ℕ0)
6 nn0uz 9940 . . . . . . 7 0 = (ℤ‘0)
7 eucalg.2 . . . . . . 7 𝑅 = seq0((𝐸 ∘ 1st ), (ℕ0 × {𝐴}))
8 0zd 9639 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → 0 ∈ ℤ)
9 id 19 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → 𝐴 ∈ (ℕ0 × ℕ0))
10 eucalgval.1 . . . . . . . . 9 𝐸 = (𝑥 ∈ ℕ0, 𝑦 ∈ ℕ0 ↦ if(𝑦 = 0, ⟨𝑥, 𝑦⟩, ⟨𝑦, (𝑥 mod 𝑦)⟩))
1110eucalgf 12816 . . . . . . . 8 𝐸:(ℕ0 × ℕ0)⟶(ℕ0 × ℕ0)
1211a1i 9 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → 𝐸:(ℕ0 × ℕ0)⟶(ℕ0 × ℕ0))
136, 7, 8, 9, 12algrf 12806 . . . . . 6 (𝐴 ∈ (ℕ0 × ℕ0) → 𝑅:ℕ0⟶(ℕ0 × ℕ0))
1413ffvelcdmda 5837 . . . . 5 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ ℕ0) → (𝑅𝐾) ∈ (ℕ0 × ℕ0))
155, 14syldan 282 . . . 4 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → (𝑅𝐾) ∈ (ℕ0 × ℕ0))
16 fvres 5717 . . . 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 5717 . . . . . . . 8 (𝐴 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘𝐴) = (2nd𝐴))
2019, 1eqtr4di 2289 . . . . . . 7 (𝐴 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘𝐴) = 𝑁)
2120fveq2d 5697 . . . . . 6 (𝐴 ∈ (ℕ0 × ℕ0) → (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)) = (ℤ𝑁))
2221eleq2d 2308 . . . . 5 (𝐴 ∈ (ℕ0 × ℕ0) → (𝐾 ∈ (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)) ↔ 𝐾 ∈ (ℤ𝑁)))
2322biimpar 297 . . . 4 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → 𝐾 ∈ (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)))
24 f2ndres 6388 . . . . 5 (2nd ↾ (ℕ0 × ℕ0)):(ℕ0 × ℕ0)⟶ℕ0
2510eucalglt 12818 . . . . . 6 (𝑧 ∈ (ℕ0 × ℕ0) → ((2nd ‘(𝐸𝑧)) ≠ 0 → (2nd ‘(𝐸𝑧)) < (2nd𝑧)))
2611ffvelcdmi 5836 . . . . . . . 8 (𝑧 ∈ (ℕ0 × ℕ0) → (𝐸𝑧) ∈ (ℕ0 × ℕ0))
27 fvres 5717 . . . . . . . 8 ((𝐸𝑧) ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) = (2nd ‘(𝐸𝑧)))
2826, 27syl 14 . . . . . . 7 (𝑧 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) = (2nd ‘(𝐸𝑧)))
2928neeq1d 2438 . . . . . 6 (𝑧 ∈ (ℕ0 × ℕ0) → (((2nd ↾ (ℕ0 × ℕ0))‘(𝐸𝑧)) ≠ 0 ↔ (2nd ‘(𝐸𝑧)) ≠ 0))
30 fvres 5717 . . . . . . 7 (𝑧 ∈ (ℕ0 × ℕ0) → ((2nd ↾ (ℕ0 × ℕ0))‘𝑧) = (2nd𝑧))
3128, 30breq12d 4141 . . . . . 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 2238 . . . . 5 ((2nd ↾ (ℕ0 × ℕ0))‘𝐴) = ((2nd ↾ (ℕ0 × ℕ0))‘𝐴)
3411, 7, 24, 32, 33algcvga 12812 . . . 4 (𝐴 ∈ (ℕ0 × ℕ0) → (𝐾 ∈ (ℤ‘((2nd ↾ (ℕ0 × ℕ0))‘𝐴)) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝑅𝐾)) = 0))
3518, 23, 34sylc 62 . . 3 ((𝐴 ∈ (ℕ0 × ℕ0) ∧ 𝐾 ∈ (ℤ𝑁)) → ((2nd ↾ (ℕ0 × ℕ0))‘(𝑅𝐾)) = 0)
3617, 35eqtr3d 2273 . 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 1402  wcel 2209  wne 2420  ifcif 3638  {csn 3708  cop 3711   class class class wbr 4128   × cxp 4770  cres 4774  ccom 4776  wf 5371  cfv 5375  (class class class)co 6079  cmpo 6081  1st c1st 6366  2nd c2nd 6367  0cc0 8173   < clt 8354  0cn0 9546  cuz 9904   mod cmo 10742  seqcseq 10867
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 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-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733  ax-cnex 8264  ax-resscn 8265  ax-1cn 8266  ax-1re 8267  ax-icn 8268  ax-addcl 8269  ax-addrcl 8270  ax-mulcl 8271  ax-mulrcl 8272  ax-addcom 8273  ax-mulcom 8274  ax-addass 8275  ax-mulass 8276  ax-distr 8277  ax-i2m1 8278  ax-0lt1 8279  ax-1rid 8280  ax-0id 8281  ax-rnegex 8282  ax-precex 8283  ax-cnre 8284  ax-pre-ltirr 8285  ax-pre-ltwlin 8286  ax-pre-lttrn 8287  ax-pre-apti 8288  ax-pre-ltadd 8289  ax-pre-mulgt0 8290  ax-pre-mulext 8291  ax-arch 8292
This theorem depends on definitions:  df-bi 117  df-stab 843  df-dc 847  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-nul 3521  df-if 3639  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-po 4439  df-iso 4440  df-iord 4509  df-on 4511  df-ilim 4512  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-frec 6656  df-pnf 8356  df-mnf 8357  df-xr 8358  df-ltxr 8359  df-le 8360  df-sub 8493  df-neg 8494  df-reap 8897  df-ap 8904  df-div 8997  df-inn 9288  df-n0 9547  df-z 9628  df-uz 9905  df-q 10003  df-rp 10038  df-fl 10688  df-mod 10743  df-seqfrec 10868
This theorem is referenced by:  eucalg  12820
  Copyright terms: Public domain W3C validator