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

Theorem mapdordlem1 42694
Description: Lemma for mapdord 42696. (Contributed by NM, 27-Jan-2015.)
Hypothesis
Ref Expression
mapdordlem1.t 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌}
Assertion
Ref Expression
mapdordlem1 (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌))
Distinct variable groups:   𝑔,𝐹   𝑔,𝐽   𝑔,𝐿   𝑔,𝑂   𝑔,𝑌
Allowed substitution hint:   𝑇(𝑔)

Proof of Theorem mapdordlem1
StepHypRef Expression
1 2fveq3 6890 . . . 4 (𝑔 = 𝐽 → (𝑂‘(𝐿‘𝑔)) = (𝑂‘(𝐿‘𝐽)))
21fveq2d 6889 . . 3 (𝑔 = 𝐽 → (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝑂‘(𝑂‘(𝐿‘𝐽))))
32eleq1d 2845 . 2 (𝑔 = 𝐽 → ((𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌 ↔ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌))
4 mapdordlem1.t . 2 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌}
53, 4elrab2 3648 1 (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  {crab 3412  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546
This theorem is used by:  mapdordlem2  42695
  Copyright terms: Public domain W3C validator