Theorem tpid3gVD 45578

Description: Virtual deduction proof of tpid3g 4737. (Contributed by Alan Sare, 24-Oct-2011.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

Ref	Expression
tpid3gVD	⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐶, 𝐷, 𝐴})

Proof of Theorem tpid3gVD

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		idn2 45350	. . . . . . 7 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 = 𝐴   ▶   𝑥 = 𝐴   )
2		3mix3 1350	. . . . . . . . . 10 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴))
3	1, 2	e2 45368	. . . . . . . . 9 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 = 𝐴   ▶   (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴)   )
4		abid 2744	. . . . . . . . 9 ⊢ (𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴)} ↔ (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴))
5	3, 4	e2bir 45370	. . . . . . . 8 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 = 𝐴   ▶   𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴)}   )
6		dftp2 4656	. . . . . . . . 9 ⊢ {𝐶, 𝐷, 𝐴} = {𝑥 ∣ (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴)}
7	6	eleq2i 2854	. . . . . . . 8 ⊢ (𝑥 ∈ {𝐶, 𝐷, 𝐴} ↔ 𝑥 ∈ {𝑥 ∣ (𝑥 = 𝐶 ∨ 𝑥 = 𝐷 ∨ 𝑥 = 𝐴)})
8	5, 7	e2bir 45370	. . . . . . 7 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 = 𝐴   ▶   𝑥 ∈ {𝐶, 𝐷, 𝐴}   )
9		eleq1 2850	. . . . . . . 8 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝐶, 𝐷, 𝐴} ↔ 𝐴 ∈ {𝐶, 𝐷, 𝐴}))
10	9	biimpd 232	. . . . . . 7 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ {𝐶, 𝐷, 𝐴} → 𝐴 ∈ {𝐶, 𝐷, 𝐴}))
11	1, 8, 10	e22 45408	. . . . . 6 ⊢ (   𝐴 ∈ 𝐵   ,   𝑥 = 𝐴   ▶   𝐴 ∈ {𝐶, 𝐷, 𝐴}   )
12	11	in2 45342	. . . . 5 ⊢ (   𝐴 ∈ 𝐵   ▶   (𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴})   )
13	12	gen11 45353	. . . 4 ⊢ (   𝐴 ∈ 𝐵   ▶   ∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴})   )
14		19.23v 1971	. . . 4 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}) ↔ (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}))
15	13, 14	e1bi 45366	. . 3 ⊢ (   𝐴 ∈ 𝐵   ▶   (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴})   )
16		idn1 45311	. . . 4 ⊢ (   𝐴 ∈ 𝐵   ▶   𝐴 ∈ 𝐵   )
17		elisset 2844	. . . 4 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴)
18	16, 17	e1a 45364	. . 3 ⊢ (   𝐴 ∈ 𝐵   ▶   ∃𝑥 𝑥 = 𝐴   )
19		id 23	. . 3 ⊢ ((∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}) → (∃𝑥 𝑥 = 𝐴 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}))
20	15, 18, 19	e11 45425	. 2 ⊢ (   𝐴 ∈ 𝐵   ▶   𝐴 ∈ {𝐶, 𝐷, 𝐴}   )
21	20	in1 45308	1 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐶, 𝐷, 𝐴})

This proof depends on syntax axioms:   → wi 4   ∨ w3o 1101  ∀wal 1567   = wceq 1569  ∃wex 1808   ∈ wcel 2142  {cab 2740  {ctp 4592

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-12 2212  ax-ext 2734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-v 3456  df-un 3909  df-sn 4589  df-pr 4591  df-tp 4593  df-vd1 45307  df-vd2 45315

This theorem is used by: (None)