| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gaorb | Structured version Visualization version GIF version | ||
| Description: The orbit equivalence relation puts two points in the group action in the same equivalence class iff there is a group element that takes one element to the other. (Contributed by Mario Carneiro, 14-Jan-2015.) |
| Ref | Expression |
|---|---|
| gaorb.1 | ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
| Ref | Expression |
|---|---|
| gaorb | ⊢ (𝐴 ∼ 𝐵 ↔ (𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq2 7404 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑔 ⊕ 𝑥) = (𝑔 ⊕ 𝐴)) | |
| 2 | eqeq12 2779 | . . . . . 6 ⊢ (((𝑔 ⊕ 𝑥) = (𝑔 ⊕ 𝐴) ∧ 𝑦 = 𝐵) → ((𝑔 ⊕ 𝑥) = 𝑦 ↔ (𝑔 ⊕ 𝐴) = 𝐵)) | |
| 3 | 1, 2 | sylan 589 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑔 ⊕ 𝑥) = 𝑦 ↔ (𝑔 ⊕ 𝐴) = 𝐵)) |
| 4 | 3 | rexbidv 3186 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦 ↔ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝐴) = 𝐵)) |
| 5 | oveq1 7403 | . . . . . 6 ⊢ (𝑔 = ℎ → (𝑔 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) | |
| 6 | 5 | eqeq1d 2764 | . . . . 5 ⊢ (𝑔 = ℎ → ((𝑔 ⊕ 𝐴) = 𝐵 ↔ (ℎ ⊕ 𝐴) = 𝐵)) |
| 7 | 6 | cbvrexvw 3241 | . . . 4 ⊢ (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝐴) = 𝐵 ↔ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵) |
| 8 | 4, 7 | bitrdi 289 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦 ↔ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
| 9 | gaorb.1 | . . . 4 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} | |
| 10 | vex 3458 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 11 | vex 3458 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
| 12 | 10, 11 | prss 4778 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ↔ {𝑥, 𝑦} ⊆ 𝑌) |
| 13 | 12 | anbi1i 633 | . . . . 5 ⊢ (((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦) ↔ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)) |
| 14 | 13 | opabbii 5167 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
| 15 | 9, 14 | eqtr4i 2788 | . . 3 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
| 16 | 8, 15 | brab2a 5740 | . 2 ⊢ (𝐴 ∼ 𝐵 ↔ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
| 17 | df-3an 1100 | . 2 ⊢ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵) ↔ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) | |
| 18 | 16, 17 | bitr4i 280 | 1 ⊢ (𝐴 ∼ 𝐵 ↔ (𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ∃wrex 3086 ⊆ wss 3904 {cpr 4584 class class class wbr 5100 {copab 5162 (class class class)co 7396 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-xp 5653 df-iota 6477 df-fv 6529 df-ov 7399 |
| This theorem is referenced by: gaorber 19348 orbsta 19353 sylow2alem1 19657 sylow2alem2 19658 sylow3lem3 19669 lsmsnorb 33577 |
| Copyright terms: Public domain | W3C validator |