Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > tfrlem3-2d | Unicode version |
Description: Lemma for transfinite recursion which changes a bound variable (Contributed by Jim Kingdon, 2-Jul-2019.) |
Ref | Expression |
---|---|
tfrlem3-2d.1 |
Ref | Expression |
---|---|
tfrlem3-2d |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tfrlem3-2d.1 | . . 3 | |
2 | fveq2 5414 | . . . . . 6 | |
3 | 2 | eleq1d 2206 | . . . . 5 |
4 | 3 | anbi2d 459 | . . . 4 |
5 | 4 | cbvalv 1889 | . . 3 |
6 | 1, 5 | sylib 121 | . 2 |
7 | 6 | 19.21bi 1537 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wal 1329 wcel 1480 cvv 2681 wfun 5112 cfv 5118 |
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-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-rex 2420 df-v 2683 df-un 3070 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-br 3925 df-iota 5083 df-fv 5126 |
This theorem is referenced by: tfrlemisucfn 6214 tfrlemisucaccv 6215 tfrlemibxssdm 6217 tfrlemibfn 6218 tfrlemi14d 6223 |
Copyright terms: Public domain | W3C validator |