Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rdgisuc1 | Unicode version |
Description: One way of describing the
value of the recursive definition generator at
a successor. There is no condition on the characteristic function
other than
. Given that, the resulting expression
encompasses both the expected successor term
but also
terms that correspond to
the initial value and to limit ordinals
.
If we add conditions on the characteristic function, we can show tighter results such as rdgisucinc 6250. (Contributed by Jim Kingdon, 9-Jun-2019.) |
Ref | Expression |
---|---|
rdgisuc1.1 | |
rdgisuc1.2 | |
rdgisuc1.3 |
Ref | Expression |
---|---|
rdgisuc1 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rdgisuc1.1 | . . 3 | |
2 | rdgisuc1.2 | . . 3 | |
3 | rdgisuc1.3 | . . . 4 | |
4 | suceloni 4387 | . . . 4 | |
5 | 3, 4 | syl 14 | . . 3 |
6 | rdgival 6247 | . . 3 | |
7 | 1, 2, 5, 6 | syl3anc 1201 | . 2 |
8 | df-suc 4263 | . . . . . . 7 | |
9 | iuneq1 3796 | . . . . . . 7 | |
10 | 8, 9 | ax-mp 5 | . . . . . 6 |
11 | iunxun 3862 | . . . . . 6 | |
12 | 10, 11 | eqtri 2138 | . . . . 5 |
13 | fveq2 5389 | . . . . . . . 8 | |
14 | 13 | fveq2d 5393 | . . . . . . 7 |
15 | 14 | iunxsng 3858 | . . . . . 6 |
16 | 15 | uneq2d 3200 | . . . . 5 |
17 | 12, 16 | syl5eq 2162 | . . . 4 |
18 | 17 | uneq2d 3200 | . . 3 |
19 | 3, 18 | syl 14 | . 2 |
20 | 7, 19 | eqtrd 2150 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wceq 1316 wcel 1465 cvv 2660 cun 3039 csn 3497 ciun 3783 con0 4255 csuc 4257 wfn 5088 cfv 5093 crdg 6234 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-coll 4013 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-ral 2398 df-rex 2399 df-reu 2400 df-rab 2402 df-v 2662 df-sbc 2883 df-csb 2976 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-nul 3334 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-iun 3785 df-br 3900 df-opab 3960 df-mpt 3961 df-tr 3997 df-id 4185 df-iord 4258 df-on 4260 df-suc 4263 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-f1 5098 df-fo 5099 df-f1o 5100 df-fv 5101 df-recs 6170 df-irdg 6235 |
This theorem is referenced by: rdgisucinc 6250 |
Copyright terms: Public domain | W3C validator |