Theorem uneqri 4089

Description: Inference from membership to union. (Contributed by NM, 21-Jun-1993.)

Hypothesis

Ref	Expression
uneqri.1	⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶)

Assertion

Ref	Expression
uneqri	⊢ (𝐴 ∪ 𝐵) = 𝐶

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem uneqri

Step	Hyp	Ref	Expression
1		elun 4086	. . 3 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
2		uneqri.1	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) ↔ 𝑥 ∈ 𝐶)
3	1, 2	bitri 277	. 2 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ 𝑥 ∈ 𝐶)
4	3	eqriv 2738	1 ⊢ (𝐴 ∪ 𝐵) = 𝐶

Syntax hints:   ↔ wb 208   ∨ wo 854   = wceq 1548   ∈ wcel 2121   ∪ cun 3883

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713

This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-tru 1551  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-v 3435  df-un 3890

This theorem is referenced by:  unidm  4090  uncom  4091  unass  4104  dfun2  4201  undi  4216  unab  4239  un0  4325  inundif  4410