Theorem elpr2g 4673

Description: A member of a pair of sets is one or the other of them, and conversely. Exercise 1 of [TakeutiZaring] p. 15. (Contributed by NM, 14-Oct-2005.) Generalize from sethood hypothesis to sethood antecedent. (Revised by BJ, 25-May-2024.)

Assertion

Ref	Expression
elpr2g	⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))

Proof of Theorem elpr2g

Step	Hyp	Ref	Expression
1		elex 3509	. . 3 ⊢ (𝐴 ∈ {𝐵, 𝐶} → 𝐴 ∈ V)
2	1	a1i 11	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐴 ∈ {𝐵, 𝐶} → 𝐴 ∈ V))
3		elex 3509	. . . 4 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V)
4		eleq1a 2839	. . . 4 ⊢ (𝐵 ∈ V → (𝐴 = 𝐵 → 𝐴 ∈ V))
5	3, 4	syl 17	. . 3 ⊢ (𝐵 ∈ 𝑉 → (𝐴 = 𝐵 → 𝐴 ∈ V))
6		elex 3509	. . . 4 ⊢ (𝐶 ∈ 𝑊 → 𝐶 ∈ V)
7		eleq1a 2839	. . . 4 ⊢ (𝐶 ∈ V → (𝐴 = 𝐶 → 𝐴 ∈ V))
8	6, 7	syl 17	. . 3 ⊢ (𝐶 ∈ 𝑊 → (𝐴 = 𝐶 → 𝐴 ∈ V))
9	5, 8	jaao 955	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) → 𝐴 ∈ V))
10		elprg 4670	. . 3 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))
11	10	a1i 11	. 2 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐴 ∈ V → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))))
12	2, 9, 11	pm5.21ndd 379	1 ⊢ ((𝐵 ∈ 𝑉 ∧ 𝐶 ∈ 𝑊) → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 846   = wceq 1537   ∈ wcel 2108  Vcvv 3488  {cpr 4650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-v 3490  df-un 3981  df-sn 4649  df-pr 4651

This theorem is referenced by:  elpr2  4674