| Mathbox for metakunt |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > uzindd | Structured version Visualization version GIF version | ||
| Description: Induction on the upper integers that start at 𝑀. The first four hypotheses give us the substitution instances we need; the following two are the basis and the induction step, a deduction version. (Contributed by metakunt, 8-Jun-2024.) |
| Ref | Expression |
|---|---|
| uzindd.1 | ⊢ (𝑗 = 𝑀 → (𝜓 ↔ 𝜒)) |
| uzindd.2 | ⊢ (𝑗 = 𝑘 → (𝜓 ↔ 𝜃)) |
| uzindd.3 | ⊢ (𝑗 = (𝑘 + 1) → (𝜓 ↔ 𝜏)) |
| uzindd.4 | ⊢ (𝑗 = 𝑁 → (𝜓 ↔ 𝜂)) |
| uzindd.5 | ⊢ (𝜑 → 𝜒) |
| uzindd.6 | ⊢ ((𝜑 ∧ 𝜃 ∧ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) → 𝜏) |
| uzindd.7 | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| uzindd.8 | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
| uzindd.9 | ⊢ (𝜑 → 𝑀 ≤ 𝑁) |
| Ref | Expression |
|---|---|
| uzindd | ⊢ (𝜑 → 𝜂) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uzindd.7 | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 2 | uzindd.8 | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
| 3 | uzindd.9 | . . 3 ⊢ (𝜑 → 𝑀 ≤ 𝑁) | |
| 4 | 1, 2, 3 | 3jca 1146 | . 2 ⊢ (𝜑 → (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) |
| 5 | uzindd.1 | . . . 4 ⊢ (𝑗 = 𝑀 → (𝜓 ↔ 𝜒)) | |
| 6 | 5 | imbi2d 343 | . . 3 ⊢ (𝑗 = 𝑀 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜒))) |
| 7 | uzindd.2 | . . . 4 ⊢ (𝑗 = 𝑘 → (𝜓 ↔ 𝜃)) | |
| 8 | 7 | imbi2d 343 | . . 3 ⊢ (𝑗 = 𝑘 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜃))) |
| 9 | uzindd.3 | . . . 4 ⊢ (𝑗 = (𝑘 + 1) → (𝜓 ↔ 𝜏)) | |
| 10 | 9 | imbi2d 343 | . . 3 ⊢ (𝑗 = (𝑘 + 1) → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜏))) |
| 11 | uzindd.4 | . . . 4 ⊢ (𝑗 = 𝑁 → (𝜓 ↔ 𝜂)) | |
| 12 | 11 | imbi2d 343 | . . 3 ⊢ (𝑗 = 𝑁 → ((𝜑 → 𝜓) ↔ (𝜑 → 𝜂))) |
| 13 | uzindd.5 | . . . . 5 ⊢ (𝜑 → 𝜒) | |
| 14 | 13 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑀 ∈ ℤ) → 𝜒) |
| 15 | 14 | expcom 419 | . . 3 ⊢ (𝑀 ∈ ℤ → (𝜑 → 𝜒)) |
| 16 | 3anass 1111 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) ↔ (𝑀 ∈ ℤ ∧ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘))) | |
| 17 | ancom 466 | . . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) ↔ ((𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) ∧ 𝑀 ∈ ℤ)) | |
| 18 | 16, 17 | bitri 278 | . . . . . . . . 9 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) ↔ ((𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) ∧ 𝑀 ∈ ℤ)) |
| 19 | uzindd.6 | . . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝜃 ∧ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) → 𝜏) | |
| 20 | 19 | ad4ant123 1191 | . . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝜃) ∧ (𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) ∧ 𝑀 ∈ ℤ) → 𝜏) |
| 21 | 20 | anasss 472 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜃) ∧ ((𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) ∧ 𝑀 ∈ ℤ)) → 𝜏) |
| 22 | 18, 21 | sylan2b 606 | . . . . . . . 8 ⊢ (((𝜑 ∧ 𝜃) ∧ (𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) → 𝜏) |
| 23 | 22 | 3impa 1127 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝜃 ∧ (𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) → 𝜏) |
| 24 | 23 | 3com23 1144 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) ∧ 𝜃) → 𝜏) |
| 25 | 24 | 3expia 1139 | . . . . 5 ⊢ ((𝜑 ∧ (𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘)) → (𝜃 → 𝜏)) |
| 26 | 25 | expcom 419 | . . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) → (𝜑 → (𝜃 → 𝜏))) |
| 27 | 26 | a2d 30 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑘 ∈ ℤ ∧ 𝑀 ≤ 𝑘) → ((𝜑 → 𝜃) → (𝜑 → 𝜏))) |
| 28 | 6, 8, 10, 12, 15, 27 | uzind 12831 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝜑 → 𝜂)) |
| 29 | 4, 28 | mpcom 39 | 1 ⊢ (𝜑 → 𝜂) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 (class class class)co 7451 1c1 11240 + caddc 11242 ≤ cle 11383 ℤcz 12733 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-n0 12647 df-z 12734 |
| This theorem is used by: 2ap1caineq 43461 |
| Copyright terms: Public domain | W3C validator |