qusgrp2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > qusgrp2		Structured version Visualization version GIF version

Theorem qusgrp2 17298

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 ] ∼ = (0_g‘𝑈)))

Distinct variable groups: 𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧, ∼ 0 ,𝑎,𝑏,𝑝,𝑞,𝑥 𝑁,𝑝 𝑅,𝑝,𝑞 + ,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦 𝜑,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧 𝑉,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧 𝑈,𝑎,𝑏,𝑝,𝑞,𝑥,𝑦,𝑧 Allowed substitution hints: + (𝑧) 𝑅(𝑥,𝑦,𝑧,𝑎,𝑏) 𝑁(𝑥,𝑦,𝑧,𝑞,𝑎,𝑏) 𝑋(𝑥,𝑦,𝑧,𝑞,𝑝,𝑎,𝑏) 0 (𝑦,𝑧)

Proof of Theorem qusgrp2 Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		qusgrp2.u	. . . 4 ⊢ (𝜑 → 𝑈 = (𝑅 /_s ∼ ))
2		qusgrp2.v	. . . 4 ⊢ (𝜑 → 𝑉 = (Base‘𝑅))
3		eqid 2605	. . . 4 ⊢ (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ) = (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )
4		qusgrp2.r	. . . . 5 ⊢ (𝜑 → ∼ Er 𝑉)
5		fvex 6094	. . . . . 6 ⊢ (Base‘𝑅) ∈ V
6	2, 5	syl6eqel 2691	. . . . 5 ⊢ (𝜑 → 𝑉 ∈ V)
7		erex 7626	. . . . 5 ⊢ ( ∼ Er 𝑉 → (𝑉 ∈ V → ∼ ∈ V))
8	4, 6, 7	sylc 62	. . . 4 ⊢ (𝜑 → ∼ ∈ V)
9		qusgrp2.x	. . . 4 ⊢ (𝜑 → 𝑅 ∈ 𝑋)
10	1, 2, 3, 8, 9	qusval 15967	. . 3 ⊢ (𝜑 → 𝑈 = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ) “_s 𝑅))
11		qusgrp2.p	. . 3 ⊢ (𝜑 → + = (+_g‘𝑅))
12	1, 2, 3, 8, 9	quslem 15968	. . 3 ⊢ (𝜑 → (𝑢 ∈ 𝑉 ↦ [𝑢] ∼ ):𝑉–onto→(𝑉 / ∼ ))
13		qusgrp2.1	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉) → (𝑥 + 𝑦) ∈ 𝑉)
14	13	3expb 1257	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉)) → (𝑥 + 𝑦) ∈ 𝑉)
15		qusgrp2.e	. . . 4 ⊢ (𝜑 → ((𝑎 ∼ 𝑝 ∧ 𝑏 ∼ 𝑞) → (𝑎 + 𝑏) ∼ (𝑝 + 𝑞)))
16	4, 6, 3, 14, 15	ercpbl 15974	. . 3 ⊢ ((𝜑 ∧ (𝑎 ∈ 𝑉 ∧ 𝑏 ∈ 𝑉) ∧ (𝑝 ∈ 𝑉 ∧ 𝑞 ∈ 𝑉)) → ((((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑎) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑝) ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑏) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑞)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑎 + 𝑏)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑝 + 𝑞))))
17	4	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ∼ Er 𝑉)
18		qusgrp2.2	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝑥 + 𝑦) + 𝑧) ∼ (𝑥 + (𝑦 + 𝑧)))
19	17, 18	erthi 7653	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → [((𝑥 + 𝑦) + 𝑧)] ∼ = [(𝑥 + (𝑦 + 𝑧))] ∼ )
20	6	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → 𝑉 ∈ V)
21	17, 20, 3	divsfval 15972	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘((𝑥 + 𝑦) + 𝑧)) = [((𝑥 + 𝑦) + 𝑧)] ∼ )
22	17, 20, 3	divsfval 15972	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑥 + (𝑦 + 𝑧))) = [(𝑥 + (𝑦 + 𝑧))] ∼ )
23	19, 21, 22	3eqtr4d 2649	. . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑉 ∧ 𝑦 ∈ 𝑉 ∧ 𝑧 ∈ 𝑉)) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘((𝑥 + 𝑦) + 𝑧)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑥 + (𝑦 + 𝑧))))
24		qusgrp2.3	. . 3 ⊢ (𝜑 → 0 ∈ 𝑉)
25	4	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ∼ Er 𝑉)
26		qusgrp2.4	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ( 0 + 𝑥) ∼ 𝑥)
27	25, 26	erthi 7653	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → [( 0 + 𝑥)] ∼ = [𝑥] ∼ )
28	6	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑉 ∈ V)
29	25, 28, 3	divsfval 15972	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘( 0 + 𝑥)) = [( 0 + 𝑥)] ∼ )
30	25, 28, 3	divsfval 15972	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑥) = [𝑥] ∼ )
31	27, 29, 30	3eqtr4d 2649	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘( 0 + 𝑥)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘𝑥))
32		qusgrp2.5	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 𝑁 ∈ 𝑉)
33		qusgrp2.6	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → (𝑁 + 𝑥) ∼ 0 )
34	25, 33	ersym 7614	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → 0 ∼ (𝑁 + 𝑥))
35	25, 34	erthi 7653	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → [ 0 ] ∼ = [(𝑁 + 𝑥)] ∼ )
36	25, 28, 3	divsfval 15972	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ) = [ 0 ] ∼ )
37	25, 28, 3	divsfval 15972	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑁 + 𝑥)) = [(𝑁 + 𝑥)] ∼ )
38	35, 36, 37	3eqtr4rd 2650	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑉) → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘(𝑁 + 𝑥)) = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ))
39	10, 2, 11, 12, 16, 9, 13, 23, 24, 31, 32, 38	imasgrp2 17295	. 2 ⊢ (𝜑 → (𝑈 ∈ Grp ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ) = (0_g‘𝑈)))
40	4, 6, 3	divsfval 15972	. . . . 5 ⊢ (𝜑 → ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ) = [ 0 ] ∼ )
41	40	eqcomd 2611	. . . 4 ⊢ (𝜑 → [ 0 ] ∼ = ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ))
42	41	eqeq1d 2607	. . 3 ⊢ (𝜑 → ([ 0 ] ∼ = (0_g‘𝑈) ↔ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ) = (0_g‘𝑈)))
43	42	anbi2d 735	. 2 ⊢ (𝜑 → ((𝑈 ∈ Grp ∧ [ 0 ] ∼ = (0_g‘𝑈)) ↔ (𝑈 ∈ Grp ∧ ((𝑢 ∈ 𝑉 ↦ [𝑢] ∼ )‘ 0 ) = (0_g‘𝑈))))
44	39, 43	mpbird 245	1 ⊢ (𝜑 → (𝑈 ∈ Grp ∧ [ 0 ] ∼ = (0_g‘𝑈)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 382 ∧ w3a 1030 = wceq 1474 ∈ wcel 1975 Vcvv 3168 class class class wbr 4573 ↦ cmpt 4633 ‘cfv 5786 (class class class)co 6523 Er wer 7599 [cec 7600 / cqs 7601 Basecbs 15637 +_gcplusg 15710 0_gc0g 15865 /_s cqus 15930 Grpcgrp 17187

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1711 ax-4 1726 ax-5 1825 ax-6 1873 ax-7 1920 ax-8 1977 ax-9 1984 ax-10 2004 ax-11 2019 ax-12 2031 ax-13 2228 ax-ext 2585 ax-rep 4689 ax-sep 4699 ax-nul 4708 ax-pow 4760 ax-pr 4824 ax-un 6820 ax-cnex 9844 ax-resscn 9845 ax-1cn 9846 ax-icn 9847 ax-addcl 9848 ax-addrcl 9849 ax-mulcl 9850 ax-mulrcl 9851 ax-mulcom 9852 ax-addass 9853 ax-mulass 9854 ax-distr 9855 ax-i2m1 9856 ax-1ne0 9857 ax-1rid 9858 ax-rnegex 9859 ax-rrecex 9860 ax-cnre 9861 ax-pre-lttri 9862 ax-pre-lttrn 9863 ax-pre-ltadd 9864 ax-pre-mulgt0 9865

This theorem depends on definitions: df-bi 195 df-or 383 df-an 384 df-3or 1031 df-3an 1032 df-tru 1477 df-ex 1695 df-nf 1700 df-sb 1866 df-eu 2457 df-mo 2458 df-clab 2592 df-cleq 2598 df-clel 2601 df-nfc 2735 df-ne 2777 df-nel 2778 df-ral 2896 df-rex 2897 df-reu 2898 df-rmo 2899 df-rab 2900 df-v 3170 df-sbc 3398 df-csb 3495 df-dif 3538 df-un 3540 df-in 3542 df-ss 3549 df-pss 3551 df-nul 3870 df-if 4032 df-pw 4105 df-sn 4121 df-pr 4123 df-tp 4125 df-op 4127 df-uni 4363 df-int 4401 df-iun 4447 df-br 4574 df-opab 4634 df-mpt 4635 df-tr 4671 df-eprel 4935 df-id 4939 df-po 4945 df-so 4946 df-fr 4983 df-we 4985 df-xp 5030 df-rel 5031 df-cnv 5032 df-co 5033 df-dm 5034 df-rn 5035 df-res 5036 df-ima 5037 df-pred 5579 df-ord 5625 df-on 5626 df-lim 5627 df-suc 5628 df-iota 5750 df-fun 5788 df-fn 5789 df-f 5790 df-f1 5791 df-fo 5792 df-f1o 5793 df-fv 5794 df-riota 6485 df-ov 6526 df-oprab 6527 df-mpt2 6528 df-om 6931 df-1st 7032 df-2nd 7033 df-wrecs 7267 df-recs 7328 df-rdg 7366 df-1o 7420 df-oadd 7424 df-er 7602 df-ec 7604 df-qs 7608 df-en 7815 df-dom 7816 df-sdom 7817 df-fin 7818 df-sup 8204 df-inf 8205 df-pnf 9928 df-mnf 9929 df-xr 9930 df-ltxr 9931 df-le 9932 df-sub 10115 df-neg 10116 df-nn 10864 df-2 10922 df-3 10923 df-4 10924 df-5 10925 df-6 10926 df-7 10927 df-8 10928 df-9 10929 df-n0 11136 df-z 11207 df-dec 11322 df-uz 11516 df-fz 12149 df-struct 15639 df-ndx 15640 df-slot 15641 df-base 15642 df-plusg 15723 df-mulr 15724 df-sca 15726 df-vsca 15727 df-ip 15728 df-tset 15729 df-ple 15730 df-ds 15733 df-0g 15867 df-imas 15933 df-qus 15934 df-mgm 17007 df-sgrp 17049 df-mnd 17060 df-grp 17190

This theorem is referenced by: qusgrp 17414 frgp0 17938 pi1grplem 22584

W3C validator