| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A specialized lemma for set theory (to derive the Axiom of Pairing). (The proof was shortened by Andrew Salmon, 13-May-2011.) |
| Ref | Expression |
|---|---|
| prlem2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orc 291 |
. . . . 5
| |
| 2 | 1 | adantr 425 |
. . . 4
|
| 3 | olc 290 |
. . . . 5
| |
| 4 | 3 | adantr 425 |
. . . 4
|
| 5 | 2, 4 | jaoi 368 |
. . 3
|
| 6 | id 73 |
. . 3
| |
| 7 | 5, 6 | jca 310 |
. 2
|
| 8 | simpr 350 |
. 2
| |
| 9 | 7, 8 | impbii 174 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: zfpair 3522 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 |