Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > tpeq123d | Structured version Visualization version GIF version |
Description: Equality theorem for unordered triples. (Contributed by NM, 22-Jun-2014.) |
Ref | Expression |
---|---|
tpeq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
tpeq123d.2 | ⊢ (𝜑 → 𝐶 = 𝐷) |
tpeq123d.3 | ⊢ (𝜑 → 𝐸 = 𝐹) |
Ref | Expression |
---|---|
tpeq123d | ⊢ (𝜑 → {𝐴, 𝐶, 𝐸} = {𝐵, 𝐷, 𝐹}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | tpeq1d.1 | . . 3 ⊢ (𝜑 → 𝐴 = 𝐵) | |
2 | 1 | tpeq1d 4683 | . 2 ⊢ (𝜑 → {𝐴, 𝐶, 𝐸} = {𝐵, 𝐶, 𝐸}) |
3 | tpeq123d.2 | . . 3 ⊢ (𝜑 → 𝐶 = 𝐷) | |
4 | 3 | tpeq2d 4684 | . 2 ⊢ (𝜑 → {𝐵, 𝐶, 𝐸} = {𝐵, 𝐷, 𝐸}) |
5 | tpeq123d.3 | . . 3 ⊢ (𝜑 → 𝐸 = 𝐹) | |
6 | 5 | tpeq3d 4685 | . 2 ⊢ (𝜑 → {𝐵, 𝐷, 𝐸} = {𝐵, 𝐷, 𝐹}) |
7 | 2, 4, 6 | 3eqtrd 2862 | 1 ⊢ (𝜑 → {𝐴, 𝐶, 𝐸} = {𝐵, 𝐷, 𝐹}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 {ctp 4573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-v 3498 df-un 3943 df-sn 4570 df-pr 4572 df-tp 4574 |
This theorem is referenced by: fz0tp 13011 fz0to4untppr 13013 fzo0to3tp 13126 fzo1to4tp 13128 prdsval 16730 imasval 16786 fucval 17230 fucpropd 17249 setcval 17339 catcval 17358 estrcval 17376 xpcval 17429 efmnd 18037 psrval 20144 om1val 23636 s3rn 30624 ldualset 36263 erngfset 37937 erngfset-rN 37945 dvafset 38142 dvaset 38143 dvhfset 38218 dvhset 38219 hlhilset 39072 rabren3dioph 39419 mendval 39790 nnsum4primesodd 43968 nnsum4primesoddALTV 43969 rngcvalALTV 44239 ringcvalALTV 44285 |
Copyright terms: Public domain | W3C validator |