Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  mapdordlem1bN Unicode version

Theorem mapdordlem1bN 31825
Description: Lemma for mapdord 31828. (Contributed by NM, 27-Jan-2015.) (New usage is discouraged.)
Hypothesis
Ref Expression
mapdordlem1b.c  |-  C  =  { g  e.  F  |  ( O `  ( O `  ( L `
 g ) ) )  =  ( L `
 g ) }
Assertion
Ref Expression
mapdordlem1bN  |-  ( J  e.  C  <->  ( J  e.  F  /\  ( O `  ( O `  ( L `  J
) ) )  =  ( L `  J
) ) )
Distinct variable groups:    g, F    g, J    g, L    g, O
Allowed substitution hint:    C( g)

Proof of Theorem mapdordlem1bN
StepHypRef Expression
1 mapdordlem1b.c . 2  |-  C  =  { g  e.  F  |  ( O `  ( O `  ( L `
 g ) ) )  =  ( L `
 g ) }
21lcfl1lem 31681 1  |-  ( J  e.  C  <->  ( J  e.  F  /\  ( O `  ( O `  ( L `  J
) ) )  =  ( L `  J
) ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358    = wceq 1623    e. wcel 1684   {crab 2547   ` cfv 5255
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-iota 5219  df-fv 5263
  Copyright terms: Public domain W3C validator