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 7199 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑔 ⊕ 𝑥) = (𝑔 ⊕ 𝐴)) | |
2 | eqeq12 2750 | . . . . . 6 ⊢ (((𝑔 ⊕ 𝑥) = (𝑔 ⊕ 𝐴) ∧ 𝑦 = 𝐵) → ((𝑔 ⊕ 𝑥) = 𝑦 ↔ (𝑔 ⊕ 𝐴) = 𝐵)) | |
3 | 1, 2 | sylan 583 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑔 ⊕ 𝑥) = 𝑦 ↔ (𝑔 ⊕ 𝐴) = 𝐵)) |
4 | 3 | rexbidv 3206 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦 ↔ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝐴) = 𝐵)) |
5 | oveq1 7198 | . . . . . 6 ⊢ (𝑔 = ℎ → (𝑔 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) | |
6 | 5 | eqeq1d 2738 | . . . . 5 ⊢ (𝑔 = ℎ → ((𝑔 ⊕ 𝐴) = 𝐵 ↔ (ℎ ⊕ 𝐴) = 𝐵)) |
7 | 6 | cbvrexvw 3349 | . . . 4 ⊢ (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝐴) = 𝐵 ↔ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵) |
8 | 4, 7 | bitrdi 290 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦 ↔ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
9 | gaorb.1 | . . . 4 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} | |
10 | vex 3402 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
11 | vex 3402 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
12 | 10, 11 | prss 4719 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ↔ {𝑥, 𝑦} ⊆ 𝑌) |
13 | 12 | anbi1i 627 | . . . . 5 ⊢ (((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦) ↔ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)) |
14 | 13 | opabbii 5106 | . . . 4 ⊢ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} = {〈𝑥, 𝑦〉 ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
15 | 9, 14 | eqtr4i 2762 | . . 3 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
16 | 8, 15 | brab2a 5626 | . 2 ⊢ (𝐴 ∼ 𝐵 ↔ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
17 | df-3an 1091 | . 2 ⊢ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵) ↔ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) | |
18 | 16, 17 | bitr4i 281 | 1 ⊢ (𝐴 ∼ 𝐵 ↔ (𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 209 ∧ wa 399 ∧ w3a 1089 = wceq 1543 ∈ wcel 2112 ∃wrex 3052 ⊆ wss 3853 {cpr 4529 class class class wbr 5039 {copab 5101 (class class class)co 7191 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-ral 3056 df-rex 3057 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-in 3860 df-ss 3870 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-uni 4806 df-br 5040 df-opab 5102 df-xp 5542 df-iota 6316 df-fv 6366 df-ov 7194 |
This theorem is referenced by: gaorber 18656 orbsta 18661 sylow2alem1 18960 sylow2alem2 18961 sylow3lem3 18972 lsmsnorb 31247 |
Copyright terms: Public domain | W3C validator |