| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dftp2 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of unordered triple of classes. Special case of Definition 5.3 of [TakeutiZaring] p. 16. (Contributed by NM, 8-Apr-1994.) |
| Ref | Expression |
|---|---|
| dftp2 | ⊢ {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vex 3457 | . . 3 ⊢ 𝑥 ∈ V | |
| 2 | 1 | eltp 4654 | . 2 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)) |
| 3 | 2 | eqabi 2896 | 1 ⊢ {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ w3o 1100 = wceq 1568 {cab 2739 {ctp 4592 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-ext 2733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-tru 1571 df-ex 1808 df-sb 2095 df-clab 2740 df-cleq 2753 df-clel 2836 df-v 3455 df-un 3909 df-sn 4589 df-pr 4591 df-tp 4593 |
| This theorem is referenced by: tprot 4714 en3lplem2 9581 rabsstp 32814 abtp 44106 tpid3gVD 45520 en3lplem2VD 45522 |
| Copyright terms: Public domain | W3C validator |