Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfrlem4 | Unicode version |
Description: Lemma for transfinite recursion. is the class of all "acceptable" functions, and is their union. First we show that an acceptable function is in fact a function. (Contributed by NM, 9-Apr-1995.) |
Ref | Expression |
---|---|
tfrlem.1 |
Ref | Expression |
---|---|
tfrlem4 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfrlem.1 | . . . 4 | |
2 | 1 | tfrlem3 5926 | . . 3 |
3 | 2 | abeq2i 2148 | . 2 |
4 | fnfun 4996 | . . . 4 | |
5 | 4 | adantr 261 | . . 3 |
6 | 5 | rexlimivw 2429 | . 2 |
7 | 3, 6 | sylbi 114 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wceq 1243 wcel 1393 cab 2026 wral 2306 wrex 2307 con0 4100 cres 4347 wfun 4896 wfn 4897 cfv 4902 |
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-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-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-opab 3819 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-res 4357 df-iota 4867 df-fun 4904 df-fn 4905 df-fv 4910 |
This theorem is referenced by: tfrlem6 5932 |
Copyright terms: Public domain | W3C validator |