Theorem bnj216 32851

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 6370	. 2 ⊢ 𝐵 ∈ suc 𝐵
3		eleq2 2826	. 2 ⊢ (𝐴 = suc 𝐵 → (𝐵 ∈ 𝐴 ↔ 𝐵 ∈ suc 𝐵))
4	2, 3	mpbiri 257	1 ⊢ (𝐴 = suc 𝐵 → 𝐵 ∈ 𝐴)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2105  Vcvv 3441  suc csuc 6291

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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-ext 2708

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-tru 1543  df-ex 1781  df-sb 2067  df-clab 2715  df-cleq 2729  df-clel 2815  df-v 3443  df-un 3902  df-sn 4572  df-suc 6295

This theorem is referenced by:  bnj219  32852  bnj1098  32902  bnj556  33019  bnj557  33020  bnj594  33031  bnj944  33057  bnj966  33063  bnj969  33065  bnj1145  33112