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 3426 | . . 3 ⊢ 𝑥 ∈ V | |
2 | 1 | eltp 4621 | . 2 ⊢ (𝑥 ∈ {𝐴, 𝐵, 𝐶} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)) |
3 | 2 | abbi2i 2878 | 1 ⊢ {𝐴, 𝐵, 𝐶} = {𝑥 ∣ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵 ∨ 𝑥 = 𝐶)} |
Colors of variables: wff setvar class |
Syntax hints: ∨ w3o 1084 = wceq 1539 {cab 2715 {ctp 4562 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-tru 1542 df-ex 1784 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-v 3424 df-un 3888 df-sn 4559 df-pr 4561 df-tp 4563 |
This theorem is referenced by: tprot 4682 en3lplem2 9301 tpid3gVD 42351 en3lplem2VD 42353 |
Copyright terms: Public domain | W3C validator |