| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Theorem for alternate representation of ordered pairs, requiring Regularity. Exercise 34 of [Enderton] p. 207. |
| Ref | Expression |
|---|---|
| preleq.1 |
|
| preleq.2 |
|
| preleq.3 |
|
| preleq.4 |
|
| Ref | Expression |
|---|---|
| opthreg |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | preleq.1 |
. . . . 5
| |
| 2 | 1 | pri1 2450 |
. . . 4
|
| 3 | preleq.3 |
. . . . 5
| |
| 4 | 3 | pri1 2450 |
. . . 4
|
| 5 | prex 2781 |
. . . . 5
| |
| 6 | prex 2781 |
. . . . 5
| |
| 7 | 1, 5, 3, 6 | preleq 4603 |
. . . 4
|
| 8 | 2, 4, 7 | mpanl12 708 |
. . 3
|
| 9 | preq1 2448 |
. . . . . 6
| |
| 10 | 9 | eqeq1d 1483 |
. . . . 5
|
| 11 | preleq.2 |
. . . . . 6
| |
| 12 | preleq.4 |
. . . . . 6
| |
| 13 | 11, 12 | preqr2 2482 |
. . . . 5
|
| 14 | 10, 13 | syl6bi 214 |
. . . 4
|
| 15 | 14 | imdistani 443 |
. . 3
|
| 16 | 8, 15 | syl 10 |
. 2
|
| 17 | preq1 2448 |
. . . 4
| |
| 18 | 17 | adantr 389 |
. . 3
|
| 19 | preq2 2449 |
. . . . 5
| |
| 20 | 9, 19 | sylan9eq 1527 |
. . . 4
|
| 21 | preq2 2449 |
. . . 4
| |
| 22 | 20, 21 | syl 10 |
. . 3
|
| 23 | 18, 22 | eqtrd 1507 |
. 2
|
| 24 | 16, 23 | impbi 157 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 962 ax-gen 963 ax-8 964 ax-10 966 ax-11 967 ax-12 968 ax-13 969 ax-14 970 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-ext 1459 ax-sep 2703 ax-pow 2742 ax-pr 2779 ax-reg 4593 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-3an 777 df-ex 981 df-sb 1172 df-eu 1382 df-mo 1383 df-clab 1464 df-cleq 1469 df-clel 1472 df-ne 1587 df-ral 1649 df-rex 1650 df-v 1812 df-dif 2049 df-un 2050 df-in 2051 df-ss 2053 df-nul 2281 df-pw 2402 df-sn 2412 df-pr 2413 df-op 2416 df-br 2620 df-opab 2667 df-eprel 2832 df-fr 2917 |