Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rdgeq12 | Structured version Visualization version GIF version |
Description: Equality theorem for the recursive definition generator. (Contributed by Scott Fenton, 28-Apr-2012.) |
Ref | Expression |
---|---|
rdgeq12 | ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → rec(𝐹, 𝐴) = rec(𝐺, 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rdgeq2 8214 | . 2 ⊢ (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵)) | |
2 | rdgeq1 8213 | . 2 ⊢ (𝐹 = 𝐺 → rec(𝐹, 𝐵) = rec(𝐺, 𝐵)) | |
3 | 1, 2 | sylan9eqr 2801 | 1 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → rec(𝐹, 𝐴) = rec(𝐺, 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 reccrdg 8211 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-ral 3068 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-xp 5586 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-iota 6376 df-fv 6426 df-ov 7258 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 |
This theorem is referenced by: seqomeq12 8255 trpredeq1 9398 trpredeq2 9399 trpred0 9410 seqeq3 13654 satf 33215 satf0 33234 csbfinxpg 35486 |
Copyright terms: Public domain | W3C validator |