Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > rdgon | Unicode version |
Description: Evaluating the recursive definition generator produces an ordinal. There is a hypothesis that the characteristic function produces ordinals on ordinal arguments. (Contributed by Jim Kingdon, 26-Jul-2019.) |
Ref | Expression |
---|---|
rdgon.1 | |
rdgon.2 | |
rdgon.3 |
Ref | Expression |
---|---|
rdgon |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 5178 | . . . . 5 | |
2 | 1 | eleq1d 2106 | . . . 4 |
3 | 2 | imbi2d 219 | . . 3 |
4 | fveq2 5178 | . . . . 5 | |
5 | 4 | eleq1d 2106 | . . . 4 |
6 | 5 | imbi2d 219 | . . 3 |
7 | r19.21v 2396 | . . . 4 | |
8 | rdgon.2 | . . . . . . . . 9 | |
9 | fvres 5198 | . . . . . . . . . . . . . 14 | |
10 | 9 | eleq1d 2106 | . . . . . . . . . . . . 13 |
11 | 10 | adantl 262 | . . . . . . . . . . . 12 |
12 | rdgon.3 | . . . . . . . . . . . . . . 15 | |
13 | fveq2 5178 | . . . . . . . . . . . . . . . . 17 | |
14 | 13 | eleq1d 2106 | . . . . . . . . . . . . . . . 16 |
15 | 14 | cbvralv 2533 | . . . . . . . . . . . . . . 15 |
16 | 12, 15 | sylib 127 | . . . . . . . . . . . . . 14 |
17 | fveq2 5178 | . . . . . . . . . . . . . . . 16 | |
18 | 17 | eleq1d 2106 | . . . . . . . . . . . . . . 15 |
19 | 18 | rspcv 2652 | . . . . . . . . . . . . . 14 |
20 | 16, 19 | syl5com 26 | . . . . . . . . . . . . 13 |
21 | 20 | adantr 261 | . . . . . . . . . . . 12 |
22 | 11, 21 | sylbird 159 | . . . . . . . . . . 11 |
23 | 22 | ralimdva 2387 | . . . . . . . . . 10 |
24 | vex 2560 | . . . . . . . . . . 11 | |
25 | iunon 5899 | . . . . . . . . . . 11 | |
26 | 24, 25 | mpan 400 | . . . . . . . . . 10 |
27 | 23, 26 | syl6 29 | . . . . . . . . 9 |
28 | onun2 4216 | . . . . . . . . 9 | |
29 | 8, 27, 28 | syl6an 1323 | . . . . . . . 8 |
30 | 29 | adantr 261 | . . . . . . 7 |
31 | rdgon.1 | . . . . . . . . . 10 | |
32 | 31, 8 | jca 290 | . . . . . . . . 9 |
33 | rdgivallem 5968 | . . . . . . . . . 10 | |
34 | 33 | 3expa 1104 | . . . . . . . . 9 |
35 | 32, 34 | sylan 267 | . . . . . . . 8 |
36 | 35 | eleq1d 2106 | . . . . . . 7 |
37 | 30, 36 | sylibrd 158 | . . . . . 6 |
38 | 37 | expcom 109 | . . . . 5 |
39 | 38 | a2d 23 | . . . 4 |
40 | 7, 39 | syl5bi 141 | . . 3 |
41 | 3, 6, 40 | tfis3 4309 | . 2 |
42 | 41 | impcom 116 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 wceq 1243 wcel 1393 wral 2306 cvv 2557 cun 2915 ciun 3657 con0 4100 cres 4347 wfn 4897 cfv 4902 crdg 5956 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-recs 5920 df-irdg 5957 |
This theorem is referenced by: oacl 6040 omcl 6041 oeicl 6042 |
Copyright terms: Public domain | W3C validator |