HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem opthreg 6267
Description: Theorem for alternate representation of ordered pairs, requiring the Axiom of Regularity ax-reg 6254 (via the preleq 6266 step). See df-op 3095 for a description of other ordered pair representations. Exercise 34 of [Enderton] p. 207.
Hypotheses
Ref Expression
preleq.1
preleq.2
preleq.3
preleq.4
Assertion
Ref Expression
opthreg

Proof of Theorem opthreg
StepHypRef Expression
1 preleq.1 . . . . 5
21prid1 3166 . . . 4
3 preleq.3 . . . . 5
43prid1 3166 . . . 4
5 prex 3563 . . . . 5
6 prex 3563 . . . . 5
71, 5, 3, 6preleq 6266 . . . 4
82, 4, 7mpanl12 658 . . 3
9 preq1 3147 . . . . . 6
109eqeq1d 1926 . . . . 5
11 preleq.2 . . . . . 6
12 preleq.4 . . . . . 6
1311, 12preqr2 3211 . . . . 5
1410, 13syl6bi 217 . . . 4
1514imdistani 667 . . 3
168, 15syl 15 . 2
17 preq1 3147 . . . 4
1817adantr 444 . . 3
19 preq12 3149 . . . 4
2019preq2d 3154 . . 3
2118, 20eqtrd 1950 . 2
2216, 21impbii 178 1
Colors of variables: wff set class
Syntax hints:   wb 174   wa 357   wceq 1414   wcel 1416  cvv 2327  cpr 3087
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-5 1331  ax-6 1332  ax-7 1333  ax-gen 1334  ax-8 1418  ax-10 1419  ax-11 1420  ax-12 1421  ax-14 1423  ax-17 1430  ax-9 1445  ax-4 1451  ax-16 1629  ax-ext 1900  ax-sep 3491  ax-nul 3500  ax-pr 3560  ax-reg 6254
This theorem depends on definitions:  df-bi 175  df-or 358  df-an 359  df-3an 901  df-ex 1336  df-sb 1591  df-eu 1818  df-mo 1819  df-clab 1906  df-cleq 1911  df-clel 1914  df-ne 2037  df-ral 2131  df-rex 2132  df-rab 2134  df-v 2329  df-dif 2640  df-un 2642  df-in 2644  df-ss 2648  df-nul 2908  df-if 3015  df-sn 3092  df-pr 3093  df-op 3095  df-br 3397  df-opab 3450  df-eprel 3646  df-fr 3689
Copyright terms: Public domain