![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > uzind4s | Structured version Visualization version GIF version |
Description: Induction on the upper set of integers that starts at an integer 𝑀, using explicit substitution. The hypotheses are the basis and the induction step. (Contributed by NM, 4-Nov-2005.) |
Ref | Expression |
---|---|
uzind4s.1 | ⊢ (𝑀 ∈ ℤ → [𝑀 / 𝑘]𝜑) |
uzind4s.2 | ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝜑 → [(𝑘 + 1) / 𝑘]𝜑)) |
Ref | Expression |
---|---|
uzind4s | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → [𝑁 / 𝑘]𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfsbcq2 3723 | . 2 ⊢ (𝑗 = 𝑀 → ([𝑗 / 𝑘]𝜑 ↔ [𝑀 / 𝑘]𝜑)) | |
2 | sbequ 2088 | . 2 ⊢ (𝑗 = 𝑚 → ([𝑗 / 𝑘]𝜑 ↔ [𝑚 / 𝑘]𝜑)) | |
3 | dfsbcq2 3723 | . 2 ⊢ (𝑗 = (𝑚 + 1) → ([𝑗 / 𝑘]𝜑 ↔ [(𝑚 + 1) / 𝑘]𝜑)) | |
4 | dfsbcq2 3723 | . 2 ⊢ (𝑗 = 𝑁 → ([𝑗 / 𝑘]𝜑 ↔ [𝑁 / 𝑘]𝜑)) | |
5 | uzind4s.1 | . 2 ⊢ (𝑀 ∈ ℤ → [𝑀 / 𝑘]𝜑) | |
6 | nfv 1915 | . . . 4 ⊢ Ⅎ𝑘 𝑚 ∈ (ℤ≥‘𝑀) | |
7 | nfs1v 2157 | . . . . 5 ⊢ Ⅎ𝑘[𝑚 / 𝑘]𝜑 | |
8 | nfsbc1v 3740 | . . . . 5 ⊢ Ⅎ𝑘[(𝑚 + 1) / 𝑘]𝜑 | |
9 | 7, 8 | nfim 1897 | . . . 4 ⊢ Ⅎ𝑘([𝑚 / 𝑘]𝜑 → [(𝑚 + 1) / 𝑘]𝜑) |
10 | 6, 9 | nfim 1897 | . . 3 ⊢ Ⅎ𝑘(𝑚 ∈ (ℤ≥‘𝑀) → ([𝑚 / 𝑘]𝜑 → [(𝑚 + 1) / 𝑘]𝜑)) |
11 | eleq1w 2872 | . . . 4 ⊢ (𝑘 = 𝑚 → (𝑘 ∈ (ℤ≥‘𝑀) ↔ 𝑚 ∈ (ℤ≥‘𝑀))) | |
12 | sbequ12 2250 | . . . . 5 ⊢ (𝑘 = 𝑚 → (𝜑 ↔ [𝑚 / 𝑘]𝜑)) | |
13 | oveq1 7142 | . . . . . 6 ⊢ (𝑘 = 𝑚 → (𝑘 + 1) = (𝑚 + 1)) | |
14 | 13 | sbceq1d 3725 | . . . . 5 ⊢ (𝑘 = 𝑚 → ([(𝑘 + 1) / 𝑘]𝜑 ↔ [(𝑚 + 1) / 𝑘]𝜑)) |
15 | 12, 14 | imbi12d 348 | . . . 4 ⊢ (𝑘 = 𝑚 → ((𝜑 → [(𝑘 + 1) / 𝑘]𝜑) ↔ ([𝑚 / 𝑘]𝜑 → [(𝑚 + 1) / 𝑘]𝜑))) |
16 | 11, 15 | imbi12d 348 | . . 3 ⊢ (𝑘 = 𝑚 → ((𝑘 ∈ (ℤ≥‘𝑀) → (𝜑 → [(𝑘 + 1) / 𝑘]𝜑)) ↔ (𝑚 ∈ (ℤ≥‘𝑀) → ([𝑚 / 𝑘]𝜑 → [(𝑚 + 1) / 𝑘]𝜑)))) |
17 | uzind4s.2 | . . 3 ⊢ (𝑘 ∈ (ℤ≥‘𝑀) → (𝜑 → [(𝑘 + 1) / 𝑘]𝜑)) | |
18 | 10, 16, 17 | chvarfv 2240 | . 2 ⊢ (𝑚 ∈ (ℤ≥‘𝑀) → ([𝑚 / 𝑘]𝜑 → [(𝑚 + 1) / 𝑘]𝜑)) |
19 | 1, 2, 3, 4, 5, 18 | uzind4 12294 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → [𝑁 / 𝑘]𝜑) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 [wsb 2069 ∈ wcel 2111 [wsbc 3720 ‘cfv 6324 (class class class)co 7135 1c1 10527 + caddc 10529 ℤcz 11969 ℤ≥cuz 12231 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-nn 11626 df-n0 11886 df-z 11970 df-uz 12232 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |