![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > wrecseq123 | Structured version Visualization version GIF version |
Description: General equality theorem for the well-ordered recursive function generator. (Contributed by Scott Fenton, 7-Jun-2018.) (Proof shortened by Scott Fenton, 17-Nov-2024.) |
Ref | Expression |
---|---|
wrecseq123 | ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝐹 = 𝐺) → wrecs(𝑅, 𝐴, 𝐹) = wrecs(𝑆, 𝐵, 𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | coeq1 5857 | . . 3 ⊢ (𝐹 = 𝐺 → (𝐹 ∘ 2nd ) = (𝐺 ∘ 2nd )) | |
2 | frecseq123 8266 | . . 3 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ (𝐹 ∘ 2nd ) = (𝐺 ∘ 2nd )) → frecs(𝑅, 𝐴, (𝐹 ∘ 2nd )) = frecs(𝑆, 𝐵, (𝐺 ∘ 2nd ))) | |
3 | 1, 2 | syl3an3 1165 | . 2 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝐹 = 𝐺) → frecs(𝑅, 𝐴, (𝐹 ∘ 2nd )) = frecs(𝑆, 𝐵, (𝐺 ∘ 2nd ))) |
4 | df-wrecs 8296 | . 2 ⊢ wrecs(𝑅, 𝐴, 𝐹) = frecs(𝑅, 𝐴, (𝐹 ∘ 2nd )) | |
5 | df-wrecs 8296 | . 2 ⊢ wrecs(𝑆, 𝐵, 𝐺) = frecs(𝑆, 𝐵, (𝐺 ∘ 2nd )) | |
6 | 3, 4, 5 | 3eqtr4g 2797 | 1 ⊢ ((𝑅 = 𝑆 ∧ 𝐴 = 𝐵 ∧ 𝐹 = 𝐺) → wrecs(𝑅, 𝐴, 𝐹) = wrecs(𝑆, 𝐵, 𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1541 ∘ ccom 5680 2nd c2nd 7973 frecscfrecs 8264 wrecscwrecs 8295 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2710 df-cleq 2724 df-clel 2810 df-ral 3062 df-rab 3433 df-v 3476 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-xp 5682 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-iota 6495 df-fv 6551 df-ov 7411 df-frecs 8265 df-wrecs 8296 |
This theorem is referenced by: wrecseq1 8302 wrecseq2 8303 wrecseq3 8304 |
Copyright terms: Public domain | W3C validator |