theorem sapprapp (F: set) (a b: nat): $ F @@ a @' b == F @' (a, b) $;
| Step | Hyp | Ref | Expression |
|---|
| 1 |
|
id |
_1 = b -> _1 = b |
| 2 |
1 |
preq2d |
_1 = b -> a, _1 = a, b |
| 3 |
2 |
rappeq2d |
_1 = b -> F @' (a, _1) == F @' (a, b) |
| 4 |
3 |
eleq2d |
_1 = b -> (y e. F @' (a, _1) <-> y e. F @' (a, b)) |
| 5 |
4 |
elsabe |
b, y e. S\ _1, F @' (a, _1) <-> y e. F @' (a, b) |
| 6 |
5 |
conv sapp |
b, y e. F @@ a <-> y e. F @' (a, b) |
| 7 |
6 |
eqab1i |
{y | b, y e. F @@ a} == F @' (a, b) |
| 8 |
7 |
conv rapp |
F @@ a @' b == F @' (a, b) |
Axiom use
axs_prop_calc
(ax_1,
ax_2,
ax_3,
ax_mp,
itru),
axs_pred_calc
(ax_gen,
ax_4,
ax_5,
ax_6,
ax_7,
ax_10,
ax_11,
ax_12),
axs_set
(elab,
ax_8),
axs_the
(theid,
the0),
axs_peano
(peano1,
peano2,
peano5,
addeq,
muleq,
add0,
addS,
mul0,
mulS)