![]() |
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 36927. (Contributed by NM, 27-Jan-2015.) |
Ref | Expression |
---|---|
mapdordlem1.t | ⊢ 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌} |
Ref | Expression |
---|---|
mapdordlem1 | ⊢ (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fveq2 6191 | . . . . 5 ⊢ (𝑔 = 𝐽 → (𝐿‘𝑔) = (𝐿‘𝐽)) | |
2 | 1 | fveq2d 6195 | . . . 4 ⊢ (𝑔 = 𝐽 → (𝑂‘(𝐿‘𝑔)) = (𝑂‘(𝐿‘𝐽))) |
3 | 2 | fveq2d 6195 | . . 3 ⊢ (𝑔 = 𝐽 → (𝑂‘(𝑂‘(𝐿‘𝑔))) = (𝑂‘(𝑂‘(𝐿‘𝐽)))) |
4 | 3 | eleq1d 2686 | . 2 ⊢ (𝑔 = 𝐽 → ((𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌 ↔ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌)) |
5 | mapdordlem1.t | . 2 ⊢ 𝑇 = {𝑔 ∈ 𝐹 ∣ (𝑂‘(𝑂‘(𝐿‘𝑔))) ∈ 𝑌} | |
6 | 4, 5 | elrab2 3366 | 1 ⊢ (𝐽 ∈ 𝑇 ↔ (𝐽 ∈ 𝐹 ∧ (𝑂‘(𝑂‘(𝐿‘𝐽))) ∈ 𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 {crab 2916 ‘cfv 5888 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-br 4654 df-iota 5851 df-fv 5896 |
This theorem is referenced by: mapdordlem2 36926 |
Copyright terms: Public domain | W3C validator |