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

Theorem uzind2 9690
Description: Induction on the upper integers that start after an integer 𝑀. The first four hypotheses give us the substitution instances we need; the last two are the basis and the induction step. (Contributed by NM, 25-Jul-2005.)
Hypotheses
Ref Expression
uzind2.1 (𝑗 = (𝑀 + 1) → (𝜑𝜓))
uzind2.2 (𝑗 = 𝑘 → (𝜑𝜒))
uzind2.3 (𝑗 = (𝑘 + 1) → (𝜑𝜃))
uzind2.4 (𝑗 = 𝑁 → (𝜑𝜏))
uzind2.5 (𝑀 ∈ ℤ → 𝜓)
uzind2.6 ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 < 𝑘) → (𝜒𝜃))
Assertion
Ref Expression
uzind2 ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 < 𝑁) → 𝜏)
Distinct variable groups:   𝑗,𝑁   𝜓,𝑗   𝜒,𝑗   𝜃,𝑗   𝜏,𝑗   𝜑,𝑘   𝑗,𝑘,𝑀
Allowed substitution hints:   𝜑(𝑗)   𝜓(𝑘)   𝜒(𝑘)   𝜃(𝑘)   𝜏(𝑘)   𝑁(𝑘)

Proof of Theorem uzind2
StepHypRef Expression
1 zltp1le 9632 . . 3 ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁 ↔ (𝑀 + 1) ≤ 𝑁))
2 peano2z 9613 . . . . . . 7 (𝑀 ∈ ℤ → (𝑀 + 1) ∈ ℤ)
3 uzind2.1 . . . . . . . . . 10 (𝑗 = (𝑀 + 1) → (𝜑𝜓))
43imbi2d 230 . . . . . . . . 9 (𝑗 = (𝑀 + 1) → ((𝑀 ∈ ℤ → 𝜑) ↔ (𝑀 ∈ ℤ → 𝜓)))
5 uzind2.2 . . . . . . . . . 10 (𝑗 = 𝑘 → (𝜑𝜒))
65imbi2d 230 . . . . . . . . 9 (𝑗 = 𝑘 → ((𝑀 ∈ ℤ → 𝜑) ↔ (𝑀 ∈ ℤ → 𝜒)))
7 uzind2.3 . . . . . . . . . 10 (𝑗 = (𝑘 + 1) → (𝜑𝜃))
87imbi2d 230 . . . . . . . . 9 (𝑗 = (𝑘 + 1) → ((𝑀 ∈ ℤ → 𝜑) ↔ (𝑀 ∈ ℤ → 𝜃)))
9 uzind2.4 . . . . . . . . . 10 (𝑗 = 𝑁 → (𝜑𝜏))
109imbi2d 230 . . . . . . . . 9 (𝑗 = 𝑁 → ((𝑀 ∈ ℤ → 𝜑) ↔ (𝑀 ∈ ℤ → 𝜏)))
11 uzind2.5 . . . . . . . . . 10 (𝑀 ∈ ℤ → 𝜓)
1211a1i 9 . . . . . . . . 9 ((𝑀 + 1) ∈ ℤ → (𝑀 ∈ ℤ → 𝜓))
13 zltp1le 9632 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑀 < 𝑘 ↔ (𝑀 + 1) ≤ 𝑘))
14 uzind2.6 . . . . . . . . . . . . . . . 16 ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 < 𝑘) → (𝜒𝜃))
15143expia 1232 . . . . . . . . . . . . . . 15 ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑀 < 𝑘 → (𝜒𝜃)))
1613, 15sylbird 170 . . . . . . . . . . . . . 14 ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑘 → (𝜒𝜃)))
1716ex 115 . . . . . . . . . . . . 13 (𝑀 ∈ ℤ → (𝑘 ∈ ℤ → ((𝑀 + 1) ≤ 𝑘 → (𝜒𝜃))))
1817com3l 81 . . . . . . . . . . . 12 (𝑘 ∈ ℤ → ((𝑀 + 1) ≤ 𝑘 → (𝑀 ∈ ℤ → (𝜒𝜃))))
1918imp 124 . . . . . . . . . . 11 ((𝑘 ∈ ℤ ∧ (𝑀 + 1) ≤ 𝑘) → (𝑀 ∈ ℤ → (𝜒𝜃)))
20193adant1 1042 . . . . . . . . . 10 (((𝑀 + 1) ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ (𝑀 + 1) ≤ 𝑘) → (𝑀 ∈ ℤ → (𝜒𝜃)))
2120a2d 26 . . . . . . . . 9 (((𝑀 + 1) ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ (𝑀 + 1) ≤ 𝑘) → ((𝑀 ∈ ℤ → 𝜒) → (𝑀 ∈ ℤ → 𝜃)))
224, 6, 8, 10, 12, 21uzind 9689 . . . . . . . 8 (((𝑀 + 1) ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ (𝑀 + 1) ≤ 𝑁) → (𝑀 ∈ ℤ → 𝜏))
23223exp 1229 . . . . . . 7 ((𝑀 + 1) ∈ ℤ → (𝑁 ∈ ℤ → ((𝑀 + 1) ≤ 𝑁 → (𝑀 ∈ ℤ → 𝜏))))
242, 23syl 14 . . . . . 6 (𝑀 ∈ ℤ → (𝑁 ∈ ℤ → ((𝑀 + 1) ≤ 𝑁 → (𝑀 ∈ ℤ → 𝜏))))
2524com34 83 . . . . 5 (𝑀 ∈ ℤ → (𝑁 ∈ ℤ → (𝑀 ∈ ℤ → ((𝑀 + 1) ≤ 𝑁𝜏))))
2625pm2.43a 51 . . . 4 (𝑀 ∈ ℤ → (𝑁 ∈ ℤ → ((𝑀 + 1) ≤ 𝑁𝜏)))
2726imp 124 . . 3 ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → ((𝑀 + 1) ≤ 𝑁𝜏))
281, 27sylbid 150 . 2 ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ) → (𝑀 < 𝑁𝜏))
29283impia 1227 1 ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 < 𝑁) → 𝜏)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1005   = wceq 1398  wcel 2203   class class class wbr 4109  (class class class)co 6050  1c1 8128   + caddc 8130   < clt 8308  cle 8309  cz 9577
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-distr 8231  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-cnre 8238  ax-pre-ltirr 8239  ax-pre-ltwlin 8240  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-iota 5312  df-fun 5354  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-sub 8446  df-neg 8447  df-inn 9238  df-n0 9497  df-z 9578
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator