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 42884
Description: Lemma for mapdord 42886. (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 6910 . . . 4 (𝑔 = 𝐽 → (𝑂‘(𝐿‘𝑔)) = (𝑂‘(𝐿‘𝐽)))
21fveq2d 6909 . . 3 (𝑔 = 𝐽 → (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝑂‘(𝑂‘(𝐿‘𝐽))))
32eleq1d 2849 . 2 (𝑔 = 𝐽 → ((𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌 ↔ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌))
4 mapdordlem1.t . 2 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌}
53, 4elrab2 3652 1 (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  {crab 3416  ‘cfv 6555
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6509  df-fv 6563
This theorem is used by:  mapdordlem2  42885
  Copyright terms: Public domain W3C validator