theorem elsabe (a b: nat) (p: wff) {x: nat} (A: set x):
$ x = a -> (b e. A <-> p) $ >
$ a, b e. S\ x, A <-> p $;
| Step | Hyp | Ref | Expression |
|---|
| 1 |
|
hyp h |
x = a -> (b e. A <-> p) |
| 2 |
1 |
anwr |
T. /\ x = a -> (b e. A <-> p) |
| 3 |
2 |
elsabed |
T. -> (a, b e. S\ x, A <-> p) |
| 4 |
3 |
trud |
a, b e. S\ x, A <-> p |
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)