| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > om2noseqsuc | Structured version Visualization version GIF version | ||
| Description: The value of 𝐺 at a successor. (Contributed by Scott Fenton, 18-Apr-2025.) |
| Ref | Expression |
|---|---|
| om2noseq.1 | ⊢ (𝜑 → 𝐶 ∈ No) |
| om2noseq.2 | ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)) |
| om2noseqsuc.3 | ⊢ (𝜑 → 𝐴 ∈ ω) |
| Ref | Expression |
|---|---|
| om2noseqsuc | ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((𝐺‘𝐴) +s 1s )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | om2noseqsuc.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ ω) | |
| 2 | ovex 7484 | . . 3 ⊢ (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s ) ∈ V | |
| 3 | eqid 2763 | . . . 4 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) | |
| 4 | oveq1 7458 | . . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 +s 1s ) = (𝑥 +s 1s )) | |
| 5 | oveq1 7458 | . . . 4 ⊢ (𝑦 = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) → (𝑦 +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) | |
| 6 | 3, 4, 5 | frsucmpt2 8486 | . . 3 ⊢ ((𝐴 ∈ ω ∧ (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s ) ∈ V) → ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘suc 𝐴) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) |
| 7 | 1, 2, 6 | sylancl 598 | . 2 ⊢ (𝜑 → ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘suc 𝐴) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) |
| 8 | om2noseq.2 | . . 3 ⊢ (𝜑 → 𝐺 = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)) | |
| 9 | 8 | fveq1d 6918 | . 2 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘suc 𝐴)) |
| 10 | 8 | fveq1d 6918 | . . 3 ⊢ (𝜑 → (𝐺‘𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴)) |
| 11 | 10 | oveq1d 7466 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) |
| 12 | 7, 9, 11 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((𝐺‘𝐴) +s 1s )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 Vcvv 3454 ↦ cmpt 5192 ↾ cres 5660 suc csuc 6390 ‘cfv 6566 (class class class)co 7451 ωcom 7911 reccrdg 8455 Nocsur 28054 1s c1s 28249 +s cadds 28402 |
| 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-pr 5398 ax-un 7783 |
| 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-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-ov 7454 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 |
| This theorem is used by: om2noseqlt 28742 om2noseqrdg 28747 noseqrdgsuc 28751 |
| Copyright terms: Public domain | W3C validator |