![]() |
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 7366 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑔 ⊕ 𝑥) = (𝑔 ⊕ 𝐴)) | |
2 | eqeq12 2750 | . . . . . 6 ⊢ (((𝑔 ⊕ 𝑥) = (𝑔 ⊕ 𝐴) ∧ 𝑦 = 𝐵) → ((𝑔 ⊕ 𝑥) = 𝑦 ↔ (𝑔 ⊕ 𝐴) = 𝐵)) | |
3 | 1, 2 | sylan 581 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → ((𝑔 ⊕ 𝑥) = 𝑦 ↔ (𝑔 ⊕ 𝐴) = 𝐵)) |
4 | 3 | rexbidv 3172 | . . . 4 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦 ↔ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝐴) = 𝐵)) |
5 | oveq1 7365 | . . . . . 6 ⊢ (𝑔 = ℎ → (𝑔 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) | |
6 | 5 | eqeq1d 2735 | . . . . 5 ⊢ (𝑔 = ℎ → ((𝑔 ⊕ 𝐴) = 𝐵 ↔ (ℎ ⊕ 𝐴) = 𝐵)) |
7 | 6 | cbvrexvw 3225 | . . . 4 ⊢ (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝐴) = 𝐵 ↔ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵) |
8 | 4, 7 | bitrdi 287 | . . 3 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦 ↔ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
9 | gaorb.1 | . . . 4 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} | |
10 | vex 3448 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
11 | vex 3448 | . . . . . . 7 ⊢ 𝑦 ∈ V | |
12 | 10, 11 | prss 4781 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ↔ {𝑥, 𝑦} ⊆ 𝑌) |
13 | 12 | anbi1i 625 | . . . . 5 ⊢ (((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦) ↔ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)) |
14 | 13 | opabbii 5173 | . . . 4 ⊢ {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ 𝑌 ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
15 | 9, 14 | eqtr4i 2764 | . . 3 ⊢ ∼ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌) ∧ ∃𝑔 ∈ 𝑋 (𝑔 ⊕ 𝑥) = 𝑦)} |
16 | 8, 15 | brab2a 5726 | . 2 ⊢ (𝐴 ∼ 𝐵 ↔ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
17 | df-3an 1090 | . 2 ⊢ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵) ↔ ((𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌) ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) | |
18 | 16, 17 | bitr4i 278 | 1 ⊢ (𝐴 ∼ 𝐵 ↔ (𝐴 ∈ 𝑌 ∧ 𝐵 ∈ 𝑌 ∧ ∃ℎ ∈ 𝑋 (ℎ ⊕ 𝐴) = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 397 ∧ w3a 1088 = wceq 1542 ∈ wcel 2107 ∃wrex 3070 ⊆ wss 3911 {cpr 4589 class class class wbr 5106 {copab 5168 (class class class)co 7358 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-sep 5257 ax-nul 5264 ax-pr 5385 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3062 df-rex 3071 df-rab 3407 df-v 3446 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4867 df-br 5107 df-opab 5169 df-xp 5640 df-iota 6449 df-fv 6505 df-ov 7361 |
This theorem is referenced by: gaorber 19093 orbsta 19098 sylow2alem1 19404 sylow2alem2 19405 sylow3lem3 19416 lsmsnorb 32220 |
Copyright terms: Public domain | W3C validator |