| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tpid3g | Structured version Visualization version GIF version | ||
| Description: Closed theorem form of tpid3 4734. (Contributed by Alan Sare, 24-Oct-2011.) (Proof shortened by JJ, 30-Apr-2021.) |
| Ref | Expression |
|---|---|
| tpid3g | ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 2 | 1 | 3mix3i 1354 | . 2 ⊢ (𝐴 = 𝐶 ∨ 𝐴 = 𝐷 ∨ 𝐴 = 𝐴) |
| 3 | eltpg 4647 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝐶, 𝐷, 𝐴} ↔ (𝐴 = 𝐶 ∨ 𝐴 = 𝐷 ∨ 𝐴 = 𝐴))) | |
| 4 | 2, 3 | mpbiri 261 | 1 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐶, 𝐷, 𝐴}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ w3o 1102 = wceq 1570 ∈ wcel 2145 {ctp 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-un 3904 df-sn 4585 df-pr 4587 df-tp 4589 |
| This theorem is used by: tpid3 4734 f1dom3fv3dif 7266 f1dom3el3dif 7267 en3lplem1 9592 en3lp 9594 tpf 14565 nb3grprlem1 29841 cplgr3v 29896 cshw1s2 33401 cyc3co2 33581 en3lplem1VD 45666 en3lpVD 45668 limsupequzlem 46551 etransclem48 47111 |
| Copyright terms: Public domain | W3C validator |