Theorem bnj219 34723

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

Assertion

Ref	Expression
bnj219	⊢ (𝑛 = suc 𝑚 → 𝑚 E 𝑛)

Proof of Theorem bnj219

Step	Hyp	Ref	Expression
1		vex 3451	. . 3 ⊢ 𝑚 ∈ V
2	1	bnj216 34722	. 2 ⊢ (𝑛 = suc 𝑚 → 𝑚 ∈ 𝑛)
3		epel 5541	. 2 ⊢ (𝑚 E 𝑛 ↔ 𝑚 ∈ 𝑛)
4	2, 3	sylibr 234	1 ⊢ (𝑛 = suc 𝑚 → 𝑚 E 𝑛)

Syntax hints:   → wi 4   = wceq 1540   class class class wbr 5107   E cep 5537  suc csuc 6334

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ne 2926  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-eprel 5538  df-suc 6338

This theorem is referenced by:  bnj605  34897  bnj594  34902  bnj607  34906  bnj1110  34972