| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tpid1g | Structured version Visualization version GIF version | ||
| Description: Closed theorem form of tpid1 4739. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| tpid1g | ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐴, 𝐶, 𝐷}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2766 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 2 | 1 | 3mix1i 1352 | . 2 ⊢ (𝐴 = 𝐴 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) |
| 3 | eltpg 4657 | . 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 2146 {ctp 4598 |
| 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 2148 ax-9 2156 ax-ext 2738 |
| 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 2745 df-cleq 2758 df-clel 2841 df-v 3460 df-un 3913 df-sn 4595 df-pr 4597 df-tp 4599 |
| This theorem is used by: tpnzd 4751 tpf 14556 cplgr3v 29822 cyc3co2 33491 limsupequzlem 46477 |
| Copyright terms: Public domain | W3C validator |