| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > prlem2 | Structured version Visualization version Unicode version | ||
| Description: A specialized lemma for set theory (to derive the Axiom of Pairing). (Contributed by NM, 21-Jun-1993.) (Proof shortened by Andrew Salmon, 13-May-2011.) (Proof shortened by Wolf Lammen, 9-Dec-2012.) |
| Ref | Expression |
|---|---|
| prlem2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 473 |
. . 3
| |
| 2 | simpl 473 |
. . 3
| |
| 3 | 1, 2 | orim12i 538 |
. 2
|
| 4 | 3 | pm4.71ri 665 |
1
|
| Colors of variables: wff setvar class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 |
| This theorem is referenced by: zfpair 4904 |
| Copyright terms: Public domain | W3C validator |