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

Theorem mapdordlem1bN 36924
Description: Lemma for mapdord 36927. (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 36780 1  |-  ( J  e.  C  <->  ( J  e.  F  /\  ( O `  ( O `  ( L `  J
) ) )  =  ( L `  J
) ) )
Colors of variables: wff setvar class
Syntax hints:    <-> wb 196    /\ wa 384    = wceq 1483    e. wcel 1990   {crab 2916   ` cfv 5888
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator