Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  caovordig Structured version   Unicode version

Theorem caovordig 6254
 Description: Convert an operation ordering law to class notation. (Contributed by Mario Carneiro, 31-Dec-2014.)
Hypothesis
Ref Expression
caovordig.1
Assertion
Ref Expression
caovordig
Distinct variable groups:   ,,,   ,,,   ,,,   ,,,   ,,,   ,,,   ,,,

Proof of Theorem caovordig
StepHypRef Expression
1 caovordig.1 . . 3
21ralrimivvva 2801 . 2
3 breq1 4217 . . . 4
4 oveq2 6091 . . . . 5
54breq1d 4224 . . . 4
63, 5imbi12d 313 . . 3
7 breq2 4218 . . . 4
8 oveq2 6091 . . . . 5
98breq2d 4226 . . . 4
107, 9imbi12d 313 . . 3
11 oveq1 6090 . . . . 5
12 oveq1 6090 . . . . 5
1311, 12breq12d 4227 . . . 4
1413imbi2d 309 . . 3
156, 10, 14rspc3v 3063 . 2
162, 15mpan9 457 1
 Colors of variables: wff set class Syntax hints:   wi 4   wa 360   w3a 937   wceq 1653   wcel 1726  wral 2707   class class class wbr 4214  (class class class)co 6083 This theorem is referenced by:  caovordid  6255 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1556  ax-5 1567  ax-17 1627  ax-9 1667  ax-8 1688  ax-6 1745  ax-7 1750  ax-11 1762  ax-12 1951  ax-ext 2419 This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 939  df-tru 1329  df-ex 1552  df-nf 1555  df-sb 1660  df-clab 2425  df-cleq 2431  df-clel 2434  df-nfc 2563  df-ral 2712  df-rex 2713  df-rab 2716  df-v 2960  df-dif 3325  df-un 3327  df-in 3329  df-ss 3336  df-nul 3631  df-if 3742  df-sn 3822  df-pr 3823  df-op 3825  df-uni 4018  df-br 4215  df-iota 5420  df-fv 5464  df-ov 6086
 Copyright terms: Public domain W3C validator