Description: A theorem is a pre-statement, whose reduct is also the reduct of a provable pre-statement. Unlike the difference between pre-statement and statement, this application of the reduct is not necessarily trivial: there are theorems that are not themselves provable but are provable once enough "dummy variables" are introduced. (Contributed by Mario Carneiro, 18-Jul-2016)
Ref | Expression | ||
---|---|---|---|
Hypotheses | mthmval.r | |
|
mthmval.j | |
||
mthmval.u | |
||
Assertion | mthmval | |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mthmval.r | |
|
2 | mthmval.j | |
|
3 | mthmval.u | |
|
4 | fveq2 | |
|
5 | 4 1 | eqtr4di | |
6 | 5 | cnveqd | |
7 | fveq2 | |
|
8 | 7 2 | eqtr4di | |
9 | 5 8 | imaeq12d | |
10 | 6 9 | imaeq12d | |
11 | df-mthm | |
|
12 | fvex | |
|
13 | 12 | cnvex | |
14 | imaexg | |
|
15 | 13 14 | ax-mp | |
16 | 10 11 15 | fvmpt3i | |
17 | 0ima | |
|
18 | 17 | eqcomi | |
19 | fvprc | |
|
20 | fvprc | |
|
21 | 1 20 | eqtrid | |
22 | 21 | cnveqd | |
23 | cnv0 | |
|
24 | 22 23 | eqtrdi | |
25 | 24 | imaeq1d | |
26 | 18 19 25 | 3eqtr4a | |
27 | 16 26 | pm2.61i | |
28 | 3 27 | eqtri | |