Theorem uzind4i 9787

Description: Induction on the upper integers that start at 𝑀. The first four give us the substitution instances we need, and the last two are the basis and the induction step. This is a stronger version of uzind4 9783 assuming that 𝜓 holds unconditionally. Notice that 𝑁 ∈ (ℤ_≥‘𝑀) implies that the lower bound 𝑀 is an integer (𝑀 ∈ ℤ, see eluzel2 9727). (Contributed by NM, 4-Sep-2005.) (Revised by AV, 13-Jul-2022.)

Hypotheses

Ref	Expression
uzind4i.1	⊢ (𝑗 = 𝑀 → (𝜑 ↔ 𝜓))
uzind4i.2	⊢ (𝑗 = 𝑘 → (𝜑 ↔ 𝜒))
uzind4i.3	⊢ (𝑗 = (𝑘 + 1) → (𝜑 ↔ 𝜃))
uzind4i.4	⊢ (𝑗 = 𝑁 → (𝜑 ↔ 𝜏))
uzind4i.5	⊢ 𝜓
uzind4i.6	⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝜒 → 𝜃))

Assertion

Ref	Expression
uzind4i	⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝜏)

Distinct variable groups:   𝑗,𝑁   𝜓,𝑗   𝜒,𝑗   𝜃,𝑗   𝜏,𝑗   𝜑,𝑘   𝑗,𝑘,𝑀

Allowed substitution hints:   𝜑(𝑗)   𝜓(𝑘)   𝜒(𝑘)   𝜃(𝑘)   𝜏(𝑘)   𝑁(𝑘)

Proof of Theorem uzind4i

Step	Hyp	Ref	Expression
1		uzind4i.1	. 2 ⊢ (𝑗 = 𝑀 → (𝜑 ↔ 𝜓))
2		uzind4i.2	. 2 ⊢ (𝑗 = 𝑘 → (𝜑 ↔ 𝜒))
3		uzind4i.3	. 2 ⊢ (𝑗 = (𝑘 + 1) → (𝜑 ↔ 𝜃))
4		uzind4i.4	. 2 ⊢ (𝑗 = 𝑁 → (𝜑 ↔ 𝜏))
5		uzind4i.5	. . 3 ⊢ 𝜓
6	5	a1i 9	. 2 ⊢ (𝑀 ∈ ℤ → 𝜓)
7		uzind4i.6	. 2 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝜒 → 𝜃))
8	1, 2, 3, 4, 6, 7	uzind4 9783	1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → 𝜏)

Syntax hints:   → wi 4   ↔ wb 105   = wceq 1395   ∈ wcel 2200  ‘cfv 5318  (class class class)co 6001  1c1 8000   + caddc 8002  ℤcz 9446  ℤ_≥cuz 9722

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-distr 8103  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-cnre 8110  ax-pre-ltirr 8111  ax-pre-ltwlin 8112  ax-pre-lttrn 8113  ax-pre-ltadd 8115

This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-riota 5954  df-ov 6004  df-oprab 6005  df-mpo 6006  df-pnf 8183  df-mnf 8184  df-xr 8185  df-ltxr 8186  df-le 8187  df-sub 8319  df-neg 8320  df-inn 9111  df-n0 9370  df-z 9447  df-uz 9723

This theorem is referenced by:  rebtwn2zlemshrink  10473  seqfveq2g  10699  seqhomog  10752  2expltfac  12962