chvar-∃1

Theorem.

Arguments:

y (sv), x (sv), phi (pr),

Dummy variables:

z (sv),

Distinct variable conditions:

(z, y), (z, x), (z, phi), (x, y),

Hypotheses:

(y bound in phi)

Assertions:

(_e1xphileftrightarrow_e1y[y/x]phi)

Proof:

Hyp Ref Line Expr
Hypo1(y bound in phi)
ax17eq2(y bound in (xeqz))
1, 2bv-↔3(y bound in (phileftrightarrow(xeqz)))
3chvar-∀4(forally[y/x](phileftrightarrow(xeqz))leftrightarrowforallx(phileftrightarrow(xeqz)))
sb-eqat<5([y/x](xeqz)leftrightarrow(yeqz))
5sb-bi>6([y/x](phileftrightarrow(xeqz))leftrightarrow([y/x]phileftrightarrow(yeqz)))
6eqt-∀-i7(forally[y/x](phileftrightarrow(xeqz))leftrightarrowforally([y/x]phileftrightarrow(yeqz)))
4, 7<>bitr8(forallx(phileftrightarrow(xeqz))leftrightarrowforally([y/x]phileftrightarrow(yeqz)))
8eqt-∃-i9(existszforallx(phileftrightarrow(xeqz))leftrightarrowexistszforally([y/x]phileftrightarrow(yeqz)))
df-∃110(_e1xphileftrightarrowexistszforallx(phileftrightarrow(xeqz)))
df-∃111(_e1y[y/x]phileftrightarrowexistszforally([y/x]phileftrightarrow(yeqz)))
9, 10, 11<2bitr12(_e1xphileftrightarrow_e1y[y/x]phi)