| 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 7451 | . . 3 ⊢ (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s ) ∈ V | |
| 3 | eqid 2761 | . . . 4 ⊢ (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) = (rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω) | |
| 4 | oveq1 7425 | . . . 4 ⊢ (𝑦 = 𝑥 → (𝑦 +s 1s ) = (𝑥 +s 1s )) | |
| 5 | oveq1 7425 | . . . 4 ⊢ (𝑦 = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) → (𝑦 +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) | |
| 6 | 3, 4, 5 | frsucmpt2 8441 | . . 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 6885 | . 2 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘suc 𝐴)) |
| 10 | 8 | fveq1d 6885 | . . 3 ⊢ (𝜑 → (𝐺‘𝐴) = ((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴)) |
| 11 | 10 | oveq1d 7433 | . 2 ⊢ (𝜑 → ((𝐺‘𝐴) +s 1s ) = (((rec((𝑥 ∈ V ↦ (𝑥 +s 1s )), 𝐶) ↾ ω)‘𝐴) +s 1s )) |
| 12 | 7, 9, 11 | 3eqtr4d 2806 | 1 ⊢ (𝜑 → (𝐺‘suc 𝐴) = ((𝐺‘𝐴) +s 1s )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3451 ↦ cmpt 5186 ↾ cres 5653 suc csuc 6363 ‘cfv 6537 (class class class)co 7418 ωcom 7875 reccrdg 8410 No csur 27990 1s c1s 28185 +s cadds 28338 |
| 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 2733 ax-sep 5249 ax-nul 5260 ax-pr 5391 ax-un 7749 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-reu 3367 df-rab 3414 df-v 3453 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 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7421 df-om 7876 df-2nd 8000 df-frecs 8292 df-wrecs 8323 df-recs 8372 df-rdg 8411 |
| This theorem is used by: om2noseqlt 28678 om2noseqrdg 28683 noseqrdgsuc 28687 |
| Copyright terms: Public domain | W3C validator |