| 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 7456 | . . 3 ⊢ (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s ) ∈ V | |
| 3 | eqid 2766 | . . . 4 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) | |
| 4 | oveq1 7430 | . . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 +s 1s ) = (𝑥 +s 1s )) | |
| 5 | oveq1 7430 | . . . 4 ⊢ (𝑦 = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) → (𝑦 +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) | |
| 6 | 3, 4, 5 | frsucmpt2 8436 | . . 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 6890 | . 2 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘suc 𝐴)) |
| 10 | 8 | fveq1d 6890 | . . 3 ⊢ (𝜑 → (𝐺‘𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴)) |
| 11 | 10 | oveq1d 7438 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) |
| 12 | 7, 9, 11 | 3eqtr4d 2811 | 1 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((𝐺‘𝐴) +s 1s )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 Vcvv 3458 ↦ cmpt 5197 ↾ cres 5668 suc csuc 6369 ‘cfv 6543 (class class class)co 7423 ωcom 7871 reccrdg 8405 No csur 27841 1s c1s 28036 +s cadds 28189 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pr 5409 ax-un 7745 |
| 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 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-ral 3083 df-rex 3093 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7426 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 |
| This theorem is used by: om2noseqlt 28529 om2noseqrdg 28534 noseqrdgsuc 28538 |
| Copyright terms: Public domain | W3C validator |