Theorem elpr2OLD 4200

Description: Obsolete proof of elpr2 4199 as of 23-Jul-2021. (Contributed by NM, 14-Oct-2005.) (New usage is discouraged.) (Proof modification is discouraged.)

Hypotheses

Ref	Expression
elpr2.1	⊢ 𝐵 ∈ V
elpr2.2	⊢ 𝐶 ∈ V

Assertion

Ref	Expression
elpr2OLD	⊢ (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))

Proof of Theorem elpr2OLD

Step	Hyp	Ref	Expression
1		elpri 4197	. 2 ⊢ (𝐴 ∈ {𝐵, 𝐶} → (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))
2		elpr2.1	. . . . . 6 ⊢ 𝐵 ∈ V
3		eleq1 2689	. . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ V ↔ 𝐵 ∈ V))
4	2, 3	mpbiri 248	. . . . 5 ⊢ (𝐴 = 𝐵 → 𝐴 ∈ V)
5		elpr2.2	. . . . . 6 ⊢ 𝐶 ∈ V
6		eleq1 2689	. . . . . 6 ⊢ (𝐴 = 𝐶 → (𝐴 ∈ V ↔ 𝐶 ∈ V))
7	5, 6	mpbiri 248	. . . . 5 ⊢ (𝐴 = 𝐶 → 𝐴 ∈ V)
8	4, 7	jaoi 394	. . . 4 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) → 𝐴 ∈ V)
9		elprg 4196	. . . 4 ⊢ (𝐴 ∈ V → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))
10	8, 9	syl 17	. . 3 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) → (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶)))
11	10	ibir 257	. 2 ⊢ ((𝐴 = 𝐵 ∨ 𝐴 = 𝐶) → 𝐴 ∈ {𝐵, 𝐶})
12	1, 11	impbii 199	1 ⊢ (𝐴 ∈ {𝐵, 𝐶} ↔ (𝐴 = 𝐵 ∨ 𝐴 = 𝐶))

Syntax hints:   ↔ wb 196   ∨ wo 383   = wceq 1483   ∈ wcel 1990  Vcvv 3200  {cpr 4179

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-v 3202  df-un 3579  df-sn 4178  df-pr 4180

This theorem is referenced by: (None)