| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Equality theorem for the recursive definition generator. |
| Ref | Expression |
|---|---|
| rdgeq2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ifeq1 2368 |
. . . . . . . . . . 11
| |
| 2 | 1 | eqeq2d 1489 |
. . . . . . . . . 10
|
| 3 | 2 | opabbidv 2675 |
. . . . . . . . 9
|
| 4 | 3 | fveq1d 3732 |
. . . . . . . 8
|
| 5 | 4 | eqeq2d 1489 |
. . . . . . 7
|
| 6 | 5 | ralbidv 1666 |
. . . . . 6
|
| 7 | 6 | anbi2d 618 |
. . . . 5
|
| 8 | 7 | rexbidv 1667 |
. . . 4
|
| 9 | 8 | abbidv 1580 |
. . 3
|
| 10 | 9 | unieqd 2516 |
. 2
|
| 11 | df-rdg 3938 |
. 2
| |
| 12 | df-rdg 3938 |
. 2
| |
| 13 | 10, 11, 12 | 3eqtr4g 1534 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: rdg0t 3950 oav 4156 seq1val 6313 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-10 968 ax-11 969 ax-12 970 ax-13 971 ax-14 972 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-10o 1142 ax-16 1212 ax-11o 1220 ax-ext 1462 ax-sep 2708 ax-pow 2748 ax-pr 2785 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 983 df-sb 1174 df-eu 1384 df-mo 1385 df-clab 1467 df-cleq 1472 df-clel 1475 df-ne 1590 df-ral 1652 df-rex 1653 df-v 1815 df-dif 2052 df-un 2053 df-in 2054 df-ss 2056 df-nul 2284 df-if 2366 df-pw 2406 df-sn 2416 df-pr 2417 df-op 2420 df-uni 2508 df-br 2625 df-opab 2672 df-cnv 3192 df-dm 3194 df-rn 3195 df-res 3196 df-ima 3197 df-fv 3204 df-rdg 3938 |