| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mapdordlem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for mapdord 42615. (Contributed by NM, 27-Jan-2015.) |
| Ref | Expression |
|---|---|
| mapdordlem1.t | ⊢ 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌} |
| Ref | Expression |
|---|---|
| mapdordlem1 | ⊢ (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2fveq3 6878 | . . . 4 ⊢ (𝑔 = 𝐽 → (𝑂‘(𝐿‘𝑔)) = (𝑂‘(𝐿‘𝐽))) | |
| 2 | 1 | fveq2d 6877 | . . 3 ⊢ (𝑔 = 𝐽 → (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝑂‘(𝑂‘(𝐿‘𝐽)))) |
| 3 | 2 | eleq1d 2845 | . 2 ⊢ (𝑔 = 𝐽 → ((𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌 ↔ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌)) |
| 4 | mapdordlem1.t | . 2 ⊢ 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌} | |
| 5 | 3, 4 | elrab2 3648 | 1 ⊢ (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 {crab 3412 ‘cfv 6527 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 |
| 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 2100 df-clab 2739 df-cleq 2752 df-clel 2835 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-br 5103 df-iota 6483 df-fv 6535 |
| This theorem is used by: mapdordlem2 42614 |
| Copyright terms: Public domain | W3C validator |