Theorem bnj1138 34452

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

Hypothesis

Ref	Expression
bnj1138.1	⊢ 𝐴 = (𝐵 ∪ 𝐶)

Assertion

Ref	Expression
bnj1138	⊢ (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶))

Proof of Theorem bnj1138

Step	Hyp	Ref	Expression
1		bnj1138.1	. . 3 ⊢ 𝐴 = (𝐵 ∪ 𝐶)
2	1	eleq2i 2821	. 2 ⊢ (𝑋 ∈ 𝐴 ↔ 𝑋 ∈ (𝐵 ∪ 𝐶))
3		elun 4149	. 2 ⊢ (𝑋 ∈ (𝐵 ∪ 𝐶) ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶))
4	2, 3	bitri 274	1 ⊢ (𝑋 ∈ 𝐴 ↔ (𝑋 ∈ 𝐵 ∨ 𝑋 ∈ 𝐶))

Syntax hints:   ↔ wb 205   ∨ wo 845   = wceq 1533   ∈ wcel 2098   ∪ cun 3947

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2699

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-tru 1536  df-ex 1774  df-sb 2060  df-clab 2706  df-cleq 2720  df-clel 2806  df-v 3475  df-un 3954

This theorem is referenced by:  bnj1424  34502  bnj1408  34700  bnj1417  34705