| 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 3436 | . . 3 ⊢ 𝑥 ∈ V | |
| 2 | 1 | eltp 4628 | . 2 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)) |
| 3 | 2 | eqabi 2875 | 1 ⊢ {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)} |
| Colors of variables: wff setvar class |
| Syntax hints: ∨ w3o 1091 = wceq 1547 {cab 2718 {ctp 4566 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-tru 1550 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-v 3434 df-un 3895 df-sn 4563 df-pr 4565 df-tp 4567 |
| This theorem is referenced by: tprot 4688 en3lplem2 9532 rabsstp 32597 abtp 43855 tpid3gVD 45286 en3lplem2VD 45288 |
| Copyright terms: Public domain | W3C validator |