Theorem mapdordlem1bN 41160

Description: Lemma for mapdord 41163. (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 41016	1 ⊢ (𝐽 ∈ 𝐶 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) = (𝐿‘𝐽)))

Syntax hints:   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098  {crab 3419  ‘cfv 6543

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-rab 3420  df-v 3465  df-dif 3944  df-un 3946  df-ss 3958  df-nul 4320  df-if 4526  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4905  df-br 5145  df-iota 6495  df-fv 6551

This theorem is referenced by: (None)