Theorem dvdemo2 5336

Description: Demonstration of a theorem that requires the setvar variables 𝑥 and 𝑧 to be disjoint (but without any other disjointness conditions, and in particular, none on 𝑦).

That theorem bundles the theorems (⊢ ∃𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝑥) with 𝑥, 𝑦, 𝑧 disjoint), often called its "principal instance", and the two "degenerate instances" (⊢ ∃𝑥(𝑥 = 𝑥 → 𝑧 ∈ 𝑥) with 𝑥, 𝑧 disjoint) and (⊢ ∃𝑥(𝑥 = 𝑧 → 𝑧 ∈ 𝑥) with 𝑥, 𝑧 disjoint).

Compare with dvdemo1 5335, which has the same principal instance and one common degenerate instance but crucially differs in the other degenerate instance.

See https://us.metamath.org/mpeuni/mmset.html#distinct 5335 for details on the "disjoint variable" mechanism.

Note that dvdemo2 5336 is partially bundled, in that the pairs of setvar variables 𝑥, 𝑦 and 𝑦, 𝑧 need not be disjoint, and in spite of that, its proof does not require any of the auxiliary axioms ax-10 2178, ax-11 2194, ax-12 2213, ax-13 2402. (Contributed by NM, 1-Dec-2006.) Avoid ax-13 2402. (Revised by BJ, 13-Jan-2024.)

Assertion

Ref	Expression
dvdemo2	⊢ ∃𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝑥)

Distinct variable group:   𝑥,𝑧

Proof of Theorem dvdemo2

Step	Hyp	Ref	Expression
1		elALT2 5331	. 2 ⊢ ∃𝑥 𝑧 ∈ 𝑥
2		ax-1 6	. 2 ⊢ (𝑧 ∈ 𝑥 → (𝑥 = 𝑦 → 𝑧 ∈ 𝑥))
3	1, 2	eximii 1870	1 ⊢ ∃𝑥(𝑥 = 𝑦 → 𝑧 ∈ 𝑥)

This proof depends on syntax axioms:   → wi 4  ∃wex 1812

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-pow 5327

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813

This theorem is used by: (None)