| 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 19192. (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 7384 | . 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∈ 𝑋) → (𝑘 ⊕ 𝐴) ∈ V) | |
| 3 | gasta.1 | . . . 4 ⊢ 𝑋 = (Base‘𝐺) | |
| 4 | gasta.2 | . . . 4 ⊢ 𝐻 = {𝑢 ∈ 𝑋 ∣ (𝑢 ⊕ 𝐴) = 𝐴} | |
| 5 | 3, 4 | gastacl 19188 | . . 3 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝐻 ∈ (SubGrp‘𝐺)) |
| 6 | orbsta.r | . . . 4 ⊢ ∼ = (𝐺 ~QG 𝐻) | |
| 7 | 3, 6 | eqger 19057 | . . 3 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋) |
| 8 | 5, 7 | syl 17 | . 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → ∼ Er 𝑋) |
| 9 | 3 | fvexi 6836 | . . 3 ⊢ 𝑋 ∈ V |
| 10 | 9 | a1i 11 | . 2 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → 𝑋 ∈ V) |
| 11 | oveq1 7356 | . 2 ⊢ (𝑘 = ℎ → (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) | |
| 12 | simpr 484 | . . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → 𝑘 ∼ ℎ) | |
| 13 | subgrcl 19010 | . . . . . . . . 9 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 14 | 3 | subgss 19006 | . . . . . . . . 9 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋) |
| 15 | eqid 2729 | . . . . . . . . . 10 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 16 | eqid 2729 | . . . . . . . . . 10 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 17 | 3, 15, 16, 6 | eqgval 19056 | . . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ⊆ 𝑋) → (𝑘 ∼ ℎ ↔ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻))) |
| 18 | 13, 14, 17 | syl2anc 584 | . . . . . . . 8 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → (𝑘 ∼ ℎ ↔ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻))) |
| 19 | 5, 18 | syl 17 | . . . . . . 7 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → (𝑘 ∼ ℎ ↔ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻))) |
| 20 | 19 | biimpa 476 | . . . . . 6 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑘)(+g‘𝐺)ℎ) ∈ 𝐻)) |
| 21 | 20 | simp1d 1142 | . . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → 𝑘 ∈ 𝑋) |
| 22 | 20 | simp2d 1143 | . . . . 5 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → ℎ ∈ 𝑋) |
| 23 | 21, 22 | jca 511 | . . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋)) |
| 24 | 3, 4, 6 | gastacos 19189 | . . . 4 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ (𝑘 ∈ 𝑋 ∧ ℎ ∈ 𝑋)) → (𝑘 ∼ ℎ ↔ (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴))) |
| 25 | 23, 24 | syldan 591 | . . 3 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ∼ ℎ ↔ (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴))) |
| 26 | 12, 25 | mpbid 232 | . 2 ⊢ ((( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) ∧ 𝑘 ∼ ℎ) → (𝑘 ⊕ 𝐴) = (ℎ ⊕ 𝐴)) |
| 27 | 1, 2, 8, 10, 11, 26 | qliftfund 8730 | 1 ⊢ (( ⊕ ∈ (𝐺 GrpAct 𝑌) ∧ 𝐴 ∈ 𝑌) → Fun 𝐹) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 {crab 3394 Vcvv 3436 ⊆ wss 3903 〈cop 4583 class class class wbr 5092 ↦ cmpt 5173 ran crn 5620 Fun wfun 6476 ‘cfv 6482 (class class class)co 7349 Er wer 8622 [cec 8623 Basecbs 17120 +gcplusg 17161 Grpcgrp 18812 invgcminusg 18813 SubGrpcsubg 18999 ~QG cqg 19001 GrpAct cga 19168 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4859 df-iun 4943 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-om 7800 df-1st 7924 df-2nd 7925 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-er 8625 df-ec 8627 df-qs 8631 df-map 8755 df-en 8873 df-dom 8874 df-sdom 8875 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-nn 12129 df-2 12191 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-0g 17345 df-mgm 18514 df-sgrp 18593 df-mnd 18609 df-grp 18815 df-minusg 18816 df-subg 19002 df-eqg 19004 df-ga 19169 |
| This theorem is referenced by: orbstaval 19191 orbsta 19192 |
| Copyright terms: Public domain | W3C validator |