| 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 4730. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| tpid1g | ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐴, 𝐶, 𝐷}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2765 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 2 | 1 | 3mix1i 1350 | . 2 ⊢ (𝐴 = 𝐴 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) |
| 3 | eltpg 4648 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝐴, 𝐶, 𝐷} ↔ (𝐴 = 𝐴 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) | |
| 4 | 2, 3 | mpbiri 261 | 1 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐴, 𝐶, 𝐷}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ w3o 1100 = wceq 1563 ∈ wcel 2145 {ctp 4589 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-tru 1566 df-ex 1803 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-v 3459 df-un 3912 df-sn 4586 df-pr 4588 df-tp 4590 |
| This theorem is referenced by: tpnzd 4742 tpf 14526 cplgr3v 29694 cyc3co2 33373 limsupequzlem 46294 |
| Copyright terms: Public domain | W3C validator |