![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > preq1i | Structured version Visualization version GIF version |
Description: Equality inference for unordered pairs. (Contributed by NM, 19-Oct-2012.) |
Ref | Expression |
---|---|
preq1i.1 | ⊢ 𝐴 = 𝐵 |
Ref | Expression |
---|---|
preq1i | ⊢ {𝐴, 𝐶} = {𝐵, 𝐶} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
2 | preq1 4629 | . 2 ⊢ (𝐴 = 𝐵 → {𝐴, 𝐶} = {𝐵, 𝐶}) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ {𝐴, 𝐶} = {𝐵, 𝐶} |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1538 {cpr 4527 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-v 3443 df-un 3886 df-sn 4526 df-pr 4528 |
This theorem is referenced by: funopg 6358 frcond1 28051 n4cyclfrgr 28076 disjdifprg2 30339 |
Copyright terms: Public domain | W3C validator |