| 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 7446 | . . 3 ⊢ (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s ) ∈ V | |
| 3 | eqid 2760 | . . . 4 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) | |
| 4 | oveq1 7420 | . . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 +s 1s ) = (𝑥 +s 1s )) | |
| 5 | oveq1 7420 | . . . 4 ⊢ (𝑦 = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) → (𝑦 +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) | |
| 6 | 3, 4, 5 | frsucmpt2 8429 | . . 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 6880 | . 2 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘suc 𝐴)) |
| 10 | 8 | fveq1d 6880 | . . 3 ⊢ (𝜑 → (𝐺‘𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴)) |
| 11 | 10 | oveq1d 7428 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) |
| 12 | 7, 9, 11 | 3eqtr4d 2805 | 1 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((𝐺‘𝐴) +s 1s )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ↦ cmpt 5186 ↾ cres 5657 suc csuc 6359 ‘cfv 6533 (class class class)co 7413 ωcom 7862 reccrdg 8398 No csur 27876 1s c1s 28071 +s cadds 28224 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 ax-un 7736 |
| 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 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 |
| This theorem is used by: om2noseqlt 28564 om2noseqrdg 28569 noseqrdgsuc 28573 |
| Copyright terms: Public domain | W3C validator |