Theorem elsuc2g 2291

Description: Variant of membership in a successor, requiring that B rather than A be a set.

Assertion

Ref	Expression
elsuc2g	⊢ (B ∈ C → (A ∈ suc B ↔ (A ∈ B ∨ A = B)))

Proof of Theorem elsuc2g

Step	Hyp	Ref	Expression
1		elsnc2g 1831	. . . 4 ⊢ (B ∈ C → (A ∈ {B} ↔ A = B))
2	1	orbi2d 466	. . 3 ⊢ (B ∈ C → ((A ∈ B ∨ A ∈ {B}) ↔ (A ∈ B ∨ A = B)))
3		elun 1601	. . 3 ⊢ (A ∈ (B ∪ {B}) ↔ (A ∈ B ∨ A ∈ {B}))
4	2, 3	syl5bb 410	. 2 ⊢ (B ∈ C → (A ∈ (B ∪ {B}) ↔ (A ∈ B ∨ A = B)))
5		df-suc 2205	. . 3 ⊢ suc B = (B ∪ {B})
6	5	eleq2i 1153	. 2 ⊢ (A ∈ suc B ↔ A ∈ (B ∪ {B}))
7	4, 6	syl5bb 410	1 ⊢ (B ∈ C → (A ∈ suc B ↔ (A ∈ B ∨ A = B)))

Syntax hints:   → wi 2   ↔ wb 127   ∨ wo 195   = wceq 1091   ∈ wcel 1092   ∪ cun 1485  {csn 1808  suc csuc 2201

This theorem is referenced by:  elsuc2 2293  om2uzlt 4654

This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074

This theorem depends on definitions:  df-bi 128  df-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-suc 2205

metamath.org