| 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 8451 | . 2 ⊢ (𝐴 = 𝐵 → rec(𝐹, 𝐴) = rec(𝐹, 𝐵)) | |
| 2 | rdgeq1 8450 | . 2 ⊢ (𝐹 = 𝐺 → rec(𝐹, 𝐵) = rec(𝐺, 𝐵)) | |
| 3 | 1, 2 | sylan9eqr 2820 | 1 ⊢ ((𝐹 = 𝐺 ∧ 𝐴 = 𝐵) → rec(𝐹, 𝐴) = rec(𝐺, 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 reccrdg 8448 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-xp 5662 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-iota 6515 df-fv 6569 df-ov 7449 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 |
| This theorem is used by: seqomeq12 8495 seqeq3 14179 seqseq123d 28705 satf 36298 satf0 36317 csbfinxpg 38516 |
| Copyright terms: Public domain | W3C validator |