| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > tpeq1 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for unordered triples. (Contributed by NM, 13-Sep-2011.) |
| Ref | Expression |
|---|---|
| tpeq1 | ⊢ (𝐴 = 𝐵 → {𝐴, 𝐶, 𝐷} = {𝐵, 𝐶, 𝐷}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | preq1 4694 | . . 3 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐶} = {𝐵, 𝐶}) | |
| 2 | 1 | uneq1d 4114 | . 2 ⊢ (𝐴 = 𝐵 → ({𝐴, 𝐶} ∪ {𝐷}) = ({𝐵, 𝐶} ∪ {𝐷})) |
| 3 | df-tp 4589 | . 2 ⊢ {𝐴, 𝐶, 𝐷} = ({𝐴, 𝐶} ∪ {𝐷}) | |
| 4 | df-tp 4589 | . 2 ⊢ {𝐵, 𝐶, 𝐷} = ({𝐵, 𝐶} ∪ {𝐷}) | |
| 5 | 2, 3, 4 | 3eqtr4g 2820 | 1 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐶, 𝐷} = {𝐵, 𝐶, 𝐷}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∪ cun 3897 {csn 4584 {cpr 4586 {ctp 4588 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-v 3452 df-un 3904 df-sn 4585 df-pr 4587 df-tp 4589 |
| This theorem is used by: tpeq1d 4706 hashtpg 14550 hash3tpde 14558 erngset 41673 erngset-rN 41681 dvh4dimN 42320 cycl3grtri 48863 grimgrtri 48865 grlimgrtri 48919 usgrexmpl1tri 48941 lmod1 49422 |
| Copyright terms: Public domain | W3C validator |