Theorem mapdordlem1bN 41592

Description: Lemma for mapdord 41595. (Contributed by NM, 27-Jan-2015.) (New usage is discouraged.)

Hypothesis

Ref	Expression
mapdordlem1b.c	⊢ 𝐶 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝐿‘𝑔)}

Assertion

Ref	Expression
mapdordlem1bN	⊢ (𝐽 ∈ 𝐶 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) = (𝐿‘𝐽)))

Distinct variable groups:   𝑔,𝐹   𝑔,𝐽   𝑔,𝐿   𝑔,𝑂

Allowed substitution hint:   𝐶(𝑔)

Proof of Theorem mapdordlem1bN

Step	Hyp	Ref	Expression
1		mapdordlem1b.c	. 2 ⊢ 𝐶 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝐿‘𝑔)}
2	1	lcfl1lem 41448	1 ⊢ (𝐽 ∈ 𝐶 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) = (𝐿‘𝐽)))

Syntax hints:   ↔ wb 206   ∧ wa 395   = wceq 1537   ∈ wcel 2108  {crab 3443  ‘cfv 6573

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-ext 2711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-iota 6525  df-fv 6581

This theorem is referenced by: (None)