Theorem bnj216 34837

Description: First-order logic and set theory. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) (New usage is discouraged.)

Hypothesis

Ref	Expression
bnj216.1	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
bnj216	⊢ (𝐴 = suc 𝐵 → 𝐵 ∈ 𝐴)

Proof of Theorem bnj216

Step	Hyp	Ref	Expression
1		bnj216.1	. . 3 ⊢ 𝐵 ∈ V
2	1	sucid 6399	. 2 ⊢ 𝐵 ∈ suc 𝐵
3		eleq2 2823	. 2 ⊢ (𝐴 = suc 𝐵 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ suc 𝐵))
4	2, 3	mpbiri 258	1 ⊢ (𝐴 = suc 𝐵 → 𝐵 ∈ 𝐴)

Syntax hints:   → wi 4   = wceq 1541   ∈ wcel 2113  Vcvv 3438  suc csuc 6317

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-v 3440  df-un 3904  df-sn 4579  df-suc 6321

This theorem is referenced by:  bnj219  34838  bnj1098  34888  bnj556  35005  bnj557  35006  bnj594  35017  bnj944  35043  bnj966  35049  bnj969  35051  bnj1145  35098