| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > tpid1g | GIF version | ||
| Description: Closed theorem form of tpid1 3784. (Contributed by Glauco Siliprandi, 23-Oct-2021.) |
| Ref | Expression |
|---|---|
| tpid1g | ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐴, 𝐶, 𝐷}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2230 | . . 3 ⊢ 𝐴 = 𝐴 | |
| 2 | 1 | 3mix1i 1195 | . 2 ⊢ (𝐴 = 𝐴 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷) |
| 3 | eltpg 3715 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ {𝐴, 𝐶, 𝐷} ↔ (𝐴 = 𝐴 ∨ 𝐴 = 𝐶 ∨ 𝐴 = 𝐷))) | |
| 4 | 2, 3 | mpbiri 168 | 1 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ {𝐴, 𝐶, 𝐷}) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∨ w3o 1003 = wceq 1397 ∈ wcel 2201 {ctp 3672 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2212 |
| This theorem depends on definitions: df-bi 117 df-3or 1005 df-tru 1400 df-nf 1509 df-sb 1810 df-clab 2217 df-cleq 2223 df-clel 2226 df-nfc 2362 df-v 2803 df-un 3203 df-sn 3676 df-pr 3677 df-tp 3678 |
| This theorem is referenced by: rngbaseg 13242 srngbased 13253 lmodbased 13271 ipsbased 13283 ipsscad 13286 topgrpbasd 13303 psrbasg 14717 |
| Copyright terms: Public domain | W3C validator |