| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > orbstafun | Structured version Visualization version GIF version | ||
| Description: Existence and uniqueness for the function of orbsta 19378. (Contributed by Mario Carneiro, 15-Jan-2015.) (Proof shortened by Mario Carneiro, 23-Dec-2016.) |
| Ref | Expression |
|---|---|
| gasta.1 | ⊢ 𝑋 = (Base‘𝐺) |
| gasta.2 | ⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴} |
| orbsta.r | ⊢ ∼ = (𝐺 ~QG 𝐻) |
| orbsta.f | ⊢ 𝐹 = ran (𝑘 ∈ 𝑋 ↦ 〈[𝑘] ∼ , (𝑘 ⊕ 𝐴)〉) |
| Ref | Expression |
|---|---|
| orbstafun | ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → Fun 𝐹) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | orbsta.f | . 2 ⊢ 𝐹 = ran (𝑘 ∈ 𝑋 ↦ 〈[𝑘] ∼ , (𝑘 ⊕ 𝐴)〉) | |
| 2 | ovexd 7445 | . 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) ∈ V) | |
| 3 | gasta.1 | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | gasta.2 | . . . 4 ⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴} | |
| 5 | 3, 4 | gastacl 19374 | . . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ∈ (SubGrp‘𝐺)) |
| 6 | orbsta.r | . . . 4 ⊢ ∼ = (𝐺 ~QG 𝐻) | |
| 7 | 3, 6 | eqger 19241 | . . 3 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋) |
| 8 | 5, 7 | syl 18 | . 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∼ Er 𝑋) |
| 9 | 3 | fvexi 6895 | . . 3 ⊢ 𝑋 ∈ V |
| 10 | 9 | a1i 11 | . 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝑋 ∈ V) |
| 11 | oveq1 7417 | . 2 ⊢ (𝑘 = ℎ → (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) | |
| 12 | simpr 489 | . . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → 𝑘 ∼ ℎ) | |
| 13 | subgrcl 19192 | . . . . . . . . 9 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 14 | 3 | subgss 19188 | . . . . . . . . 9 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋) |
| 15 | eqid 2763 | . . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 16 | eqid 2763 | . . . . . . . . . 10 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 17 | 3, 15, 16, 6 | eqgval 19240 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ⊆ 𝑋) → (𝑘 ∼ ℎ ↔ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻))) |
| 18 | 13, 14, 17 | syl2anc 595 | . . . . . . . 8 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → (𝑘 ∼ ℎ ↔ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻))) |
| 19 | 5, 18 | syl 18 | . . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (𝑘 ∼ ℎ ↔ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻))) |
| 20 | 19 | biimpa 481 | . . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻)) |
| 21 | 20 | simp1d 1160 | . . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → 𝑘 ∈ 𝑋) |
| 22 | 20 | simp2d 1161 | . . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → ℎ ∈ 𝑋) |
| 23 | 21, 22 | jca 520 | . . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋)) |
| 24 | 3, 4, 6 | gastacos 19375 | . . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋)) → (𝑘 ∼ ℎ ↔ (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴))) |
| 25 | 23, 24 | syldan 602 | . . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ∼ ℎ ↔ (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴))) |
| 26 | 12, 25 | mpbid 235 | . 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) |
| 27 | 1, 2, 8, 10, 11, 26 | qliftfund 8797 | 1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → Fun 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1103 = wceq 1570 ∈ wcel 2143 {crab 3416 Vcvv 3455 ⊆ wss 3905 〈cop 4595 class class class wbr 5109 ↦ cmpt 5192 ran crn 5662 Fun wfun 6530 ‘cfv 6536 (class class class)co 7410 Er wer 8687 [cec 8688 Basecbs 17264 +gcplusg 17305 Grpcgrp 18995 invgcminusg 18996 SubGrpcsubg 19181 ~QG cqg 19183 GrpAct cga 19354 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-er 8690 df-ec 8692 df-qs 8696 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-nn 12229 df-2 12298 df-sets 17219 df-slot 17237 df-ndx 17249 df-base 17265 df-ress 17286 df-plusg 17318 df-0g 17489 df-mgm 18693 df-sgrp 18772 df-mnd 18788 df-grp 18998 df-minusg 18999 df-subg 19184 df-eqg 19186 df-ga 19355 |
| This theorem is referenced by: orbstaval 19377 orbsta 19378 |
| Copyright terms: Public domain | W3C validator |