| 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 3445 | . . 3 ⊢ 𝑥 ∈ V | |
| 2 | 1 | eltp 4647 | . 2 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)) |
| 3 | 2 | eqabi 2872 | 1 ⊢ {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ w3o 1086 = wceq 1542 {cab 2715 {ctp 4585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-v 3443 df-un 3907 df-sn 4582 df-pr 4584 df-tp 4586 |
| This theorem is referenced by: tprot 4707 en3lplem2 9526 rabsstp 32559 abtp 43687 tpid3gVD 45118 en3lplem2VD 45120 |
| Copyright terms: Public domain | W3C validator |