![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > prcom | GIF version |
Description: Commutative law for unordered pairs. (Contributed by NM, 5-Aug-1993.) |
Ref | Expression |
---|---|
prcom | ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uncom 3225 | . 2 ⊢ ({𝐴} ∪ {𝐵}) = ({𝐵} ∪ {𝐴}) | |
2 | df-pr 3539 | . 2 ⊢ {𝐴, 𝐵} = ({𝐴} ∪ {𝐵}) | |
3 | df-pr 3539 | . 2 ⊢ {𝐵, 𝐴} = ({𝐵} ∪ {𝐴}) | |
4 | 1, 2, 3 | 3eqtr4i 2171 | 1 ⊢ {𝐴, 𝐵} = {𝐵, 𝐴} |
Colors of variables: wff set class |
Syntax hints: = wceq 1332 ∪ cun 3074 {csn 3532 {cpr 3533 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1424 ax-7 1425 ax-gen 1426 ax-ie1 1470 ax-ie2 1471 ax-8 1483 ax-10 1484 ax-11 1485 ax-i12 1486 ax-bndl 1487 ax-4 1488 ax-17 1507 ax-i9 1511 ax-ial 1515 ax-i5r 1516 ax-ext 2122 |
This theorem depends on definitions: df-bi 116 df-tru 1335 df-nf 1438 df-sb 1737 df-clab 2127 df-cleq 2133 df-clel 2136 df-nfc 2271 df-v 2691 df-un 3080 df-pr 3539 |
This theorem is referenced by: preq2 3609 tpcoma 3625 tpidm23 3632 prid2g 3636 prid2 3638 prprc2 3640 difprsn2 3668 preqr2g 3702 preqr2 3704 preq12b 3705 fvpr2 5633 fvpr2g 5635 en2other2 7069 maxcom 11007 mincom 11032 xrmax2sup 11055 xrmaxltsup 11059 xrmaxadd 11062 xrbdtri 11077 qtopbasss 12729 |
Copyright terms: Public domain | W3C validator |