ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  qusgrp2 GIF version

Theorem qusgrp2 13449
Description: Prove that a quotient structure is a group. (Contributed by Mario Carneiro, 14-Jun-2015.) (Revised by Mario Carneiro, 12-Aug-2015.)
Hypotheses
Ref Expression
qusgrp2.u (𝜑𝑈 = (𝑅 /s ))
qusgrp2.v (𝜑𝑉 = (Base‘𝑅))
qusgrp2.p (𝜑+ = (+g𝑅))
qusgrp2.r (𝜑 Er 𝑉)
qusgrp2.x (𝜑𝑅𝑋)
qusgrp2.e (𝜑 → ((𝑎 𝑝𝑏 𝑞) → (𝑎 + 𝑏) (𝑝 + 𝑞)))
qusgrp2.1 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
qusgrp2.2 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) (𝑥 + (𝑦 + 𝑧)))
qusgrp2.3 (𝜑0𝑉)
qusgrp2.4 ((𝜑𝑥𝑉) → ( 0 + 𝑥) 𝑥)
qusgrp2.5 ((𝜑𝑥𝑉) → 𝑁𝑉)
qusgrp2.6 ((𝜑𝑥𝑉) → (𝑁 + 𝑥) 0 )
Assertion
Ref Expression
qusgrp2 (𝜑 → (𝑈 ∈ Grp ∧ [ 0 ] = (0g𝑈)))
Distinct variable groups:   𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧,   0 ,𝑎,𝑏,𝑝,𝑞,𝑥   𝑁,𝑝   𝑅,𝑝,𝑞   + ,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦   𝜑,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧   𝑉,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧   𝑈,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧
Allowed substitution hints:   + (𝑧)   𝑅(𝑥,𝑦,𝑧,𝑎,𝑏)   𝑁(𝑥,𝑦,𝑧,𝑞,𝑎,𝑏)   𝑋(𝑥,𝑦,𝑧,𝑞,𝑝,𝑎,𝑏)   0 (𝑦,𝑧)

Proof of Theorem qusgrp2
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 qusgrp2.u . . . 4 (𝜑𝑈 = (𝑅 /s ))
2 qusgrp2.v . . . 4 (𝜑𝑉 = (Base‘𝑅))
3 eqid 2205 . . . 4 (𝑢𝑉 ↦ [𝑢] ) = (𝑢𝑉 ↦ [𝑢] )
4 qusgrp2.r . . . . 5 (𝜑 Er 𝑉)
5 basfn 12890 . . . . . . 7 Base Fn V
6 qusgrp2.x . . . . . . . 8 (𝜑𝑅𝑋)
76elexd 2785 . . . . . . 7 (𝜑𝑅 ∈ V)
8 funfvex 5593 . . . . . . . 8 ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
98funfni 5376 . . . . . . 7 ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
105, 7, 9sylancr 414 . . . . . 6 (𝜑 → (Base‘𝑅) ∈ V)
112, 10eqeltrd 2282 . . . . 5 (𝜑𝑉 ∈ V)
12 erex 6644 . . . . 5 ( Er 𝑉 → (𝑉 ∈ V → ∈ V))
134, 11, 12sylc 62 . . . 4 (𝜑 ∈ V)
141, 2, 3, 13, 6qusval 13155 . . 3 (𝜑𝑈 = ((𝑢𝑉 ↦ [𝑢] ) “s 𝑅))
15 qusgrp2.p . . 3 (𝜑+ = (+g𝑅))
161, 2, 3, 13, 6quslem 13156 . . 3 (𝜑 → (𝑢𝑉 ↦ [𝑢] ):𝑉onto→(𝑉 / ))
17 qusgrp2.1 . . . . 5 ((𝜑𝑥𝑉𝑦𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
18173expb 1207 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
19 qusgrp2.e . . . 4 (𝜑 → ((𝑎 𝑝𝑏 𝑞) → (𝑎 + 𝑏) (𝑝 + 𝑞)))
204, 11, 3, 18, 19ercpbl 13163 . . 3 ((𝜑 ∧ (𝑎𝑉𝑏𝑉) ∧ (𝑝𝑉𝑞𝑉)) → ((((𝑢𝑉 ↦ [𝑢] )‘𝑎) = ((𝑢𝑉 ↦ [𝑢] )‘𝑝) ∧ ((𝑢𝑉 ↦ [𝑢] )‘𝑏) = ((𝑢𝑉 ↦ [𝑢] )‘𝑞)) → ((𝑢𝑉 ↦ [𝑢] )‘(𝑎 + 𝑏)) = ((𝑢𝑉 ↦ [𝑢] )‘(𝑝 + 𝑞))))
214adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → Er 𝑉)
22 qusgrp2.2 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) (𝑥 + (𝑦 + 𝑧)))
2321, 22erthi 6668 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → [((𝑥 + 𝑦) + 𝑧)] = [(𝑥 + (𝑦 + 𝑧))] )
2411adantr 276 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → 𝑉 ∈ V)
2521, 22ercl 6631 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑥 + 𝑦) + 𝑧) ∈ 𝑉)
2621, 24, 3, 25divsfvalg 13161 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑢𝑉 ↦ [𝑢] )‘((𝑥 + 𝑦) + 𝑧)) = [((𝑥 + 𝑦) + 𝑧)] )
2721, 22ercl2 6633 . . . . 5 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → (𝑥 + (𝑦 + 𝑧)) ∈ 𝑉)
2821, 24, 3, 27divsfvalg 13161 . . . 4 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑢𝑉 ↦ [𝑢] )‘(𝑥 + (𝑦 + 𝑧))) = [(𝑥 + (𝑦 + 𝑧))] )
2923, 26, 283eqtr4d 2248 . . 3 ((𝜑 ∧ (𝑥𝑉𝑦𝑉𝑧𝑉)) → ((𝑢𝑉 ↦ [𝑢] )‘((𝑥 + 𝑦) + 𝑧)) = ((𝑢𝑉 ↦ [𝑢] )‘(𝑥 + (𝑦 + 𝑧))))
30 qusgrp2.3 . . 3 (𝜑0𝑉)
314adantr 276 . . . . 5 ((𝜑𝑥𝑉) → Er 𝑉)
32 qusgrp2.4 . . . . 5 ((𝜑𝑥𝑉) → ( 0 + 𝑥) 𝑥)
3331, 32erthi 6668 . . . 4 ((𝜑𝑥𝑉) → [( 0 + 𝑥)] = [𝑥] )
3411adantr 276 . . . . 5 ((𝜑𝑥𝑉) → 𝑉 ∈ V)
3531, 32ercl 6631 . . . . 5 ((𝜑𝑥𝑉) → ( 0 + 𝑥) ∈ 𝑉)
3631, 34, 3, 35divsfvalg 13161 . . . 4 ((𝜑𝑥𝑉) → ((𝑢𝑉 ↦ [𝑢] )‘( 0 + 𝑥)) = [( 0 + 𝑥)] )
37 simpr 110 . . . . 5 ((𝜑𝑥𝑉) → 𝑥𝑉)
3831, 34, 3, 37divsfvalg 13161 . . . 4 ((𝜑𝑥𝑉) → ((𝑢𝑉 ↦ [𝑢] )‘𝑥) = [𝑥] )
3933, 36, 383eqtr4d 2248 . . 3 ((𝜑𝑥𝑉) → ((𝑢𝑉 ↦ [𝑢] )‘( 0 + 𝑥)) = ((𝑢𝑉 ↦ [𝑢] )‘𝑥))
40 qusgrp2.5 . . 3 ((𝜑𝑥𝑉) → 𝑁𝑉)
41 qusgrp2.6 . . . . . 6 ((𝜑𝑥𝑉) → (𝑁 + 𝑥) 0 )
4231, 41ersym 6632 . . . . 5 ((𝜑𝑥𝑉) → 0 (𝑁 + 𝑥))
4331, 42erthi 6668 . . . 4 ((𝜑𝑥𝑉) → [ 0 ] = [(𝑁 + 𝑥)] )
4430adantr 276 . . . . 5 ((𝜑𝑥𝑉) → 0𝑉)
4531, 34, 3, 44divsfvalg 13161 . . . 4 ((𝜑𝑥𝑉) → ((𝑢𝑉 ↦ [𝑢] )‘ 0 ) = [ 0 ] )
4631, 41ercl 6631 . . . . 5 ((𝜑𝑥𝑉) → (𝑁 + 𝑥) ∈ 𝑉)
4731, 34, 3, 46divsfvalg 13161 . . . 4 ((𝜑𝑥𝑉) → ((𝑢𝑉 ↦ [𝑢] )‘(𝑁 + 𝑥)) = [(𝑁 + 𝑥)] )
4843, 45, 473eqtr4rd 2249 . . 3 ((𝜑𝑥𝑉) → ((𝑢𝑉 ↦ [𝑢] )‘(𝑁 + 𝑥)) = ((𝑢𝑉 ↦ [𝑢] )‘ 0 ))
4914, 2, 15, 16, 20, 6, 17, 29, 30, 39, 40, 48imasgrp2 13446 . 2 (𝜑 → (𝑈 ∈ Grp ∧ ((𝑢𝑉 ↦ [𝑢] )‘ 0 ) = (0g𝑈)))
504, 11, 3, 30divsfvalg 13161 . . . . 5 (𝜑 → ((𝑢𝑉 ↦ [𝑢] )‘ 0 ) = [ 0 ] )
5150eqcomd 2211 . . . 4 (𝜑 → [ 0 ] = ((𝑢𝑉 ↦ [𝑢] )‘ 0 ))
5251eqeq1d 2214 . . 3 (𝜑 → ([ 0 ] = (0g𝑈) ↔ ((𝑢𝑉 ↦ [𝑢] )‘ 0 ) = (0g𝑈)))
5352anbi2d 464 . 2 (𝜑 → ((𝑈 ∈ Grp ∧ [ 0 ] = (0g𝑈)) ↔ (𝑈 ∈ Grp ∧ ((𝑢𝑉 ↦ [𝑢] )‘ 0 ) = (0g𝑈))))
5449, 53mpbird 167 1 (𝜑 → (𝑈 ∈ Grp ∧ [ 0 ] = (0g𝑈)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 981   = wceq 1373  wcel 2176  Vcvv 2772   class class class wbr 4044  cmpt 4105   Fn wfn 5266  cfv 5271  (class class class)co 5944   Er wer 6617  [cec 6618   / cqs 6619  Basecbs 12832  +gcplusg 12909  0gc0g 13088   /s cqus 13132  Grpcgrp 13332
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-addcom 8025  ax-addass 8027  ax-i2m1 8030  ax-0lt1 8031  ax-0id 8033  ax-rnegex 8034  ax-pre-ltirr 8037  ax-pre-lttrn 8039  ax-pre-ltadd 8041
This theorem depends on definitions:  df-bi 117  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-tp 3641  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-er 6620  df-ec 6622  df-qs 6626  df-pnf 8109  df-mnf 8110  df-ltxr 8112  df-inn 9037  df-2 9095  df-3 9096  df-ndx 12835  df-slot 12836  df-base 12838  df-plusg 12922  df-mulr 12923  df-0g 13090  df-iimas 13134  df-qus 13135  df-mgm 13188  df-sgrp 13234  df-mnd 13249  df-grp 13335
This theorem is referenced by:  qusgrp  13568
  Copyright terms: Public domain W3C validator