Theorem grppropd 12928

Description: If two structures have the same group components (properties), one is a group iff the other one is. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Revised by Mario Carneiro, 2-Oct-2015.)

Hypotheses

Ref	Expression
grppropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
grppropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
grppropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))

Assertion

Ref	Expression
grppropd	⊢ (𝜑 → (𝐾 ∈ Grp ↔ 𝐿 ∈ Grp))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝑥,𝐿,𝑦   𝜑,𝑥,𝑦

Proof of Theorem grppropd

Dummy variables 𝑧 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		grppropd.1	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		grppropd.2	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
3		grppropd.3	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
4	1, 2, 3	mndpropd 12867	. . 3 ⊢ (𝜑 → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd))
5	1	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐵 = (Base‘𝐾))
6	2	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐵 = (Base‘𝐿))
7		simprl 529	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
8	5, 7	basmexd 12540	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐾 ∈ V)
9	6, 7	basmexd 12540	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐿 ∈ V)
10	3	ralrimivva 2572	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
11		oveq1 5898	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → (𝑥(+g‘𝐾)𝑦) = (𝑧(+g‘𝐾)𝑦))
12		oveq1 5898	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → (𝑥(+g‘𝐿)𝑦) = (𝑧(+g‘𝐿)𝑦))
13	11, 12	eqeq12d 2204	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → ((𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) ↔ (𝑧(+g‘𝐾)𝑦) = (𝑧(+g‘𝐿)𝑦)))
14		oveq2 5899	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑤 → (𝑧(+g‘𝐾)𝑦) = (𝑧(+g‘𝐾)𝑤))
15		oveq2 5899	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑤 → (𝑧(+g‘𝐿)𝑦) = (𝑧(+g‘𝐿)𝑤))
16	14, 15	eqeq12d 2204	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑤 → ((𝑧(+g‘𝐾)𝑦) = (𝑧(+g‘𝐿)𝑦) ↔ (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤)))
17	13, 16	cbvral2v 2731	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) ↔ ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
18	10, 17	sylib 122	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
19	18	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
20	19	r19.21bi 2578	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
21	20	r19.21bi 2578	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) ∧ 𝑤 ∈ 𝐵) → (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
22	21	anasss 399	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
23	5, 6, 8, 9, 22	grpidpropdg 12816	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
24	3, 23	eqeq12d 2204	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
25	24	anass1rs 571	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
26	25	rexbidva 2487	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
27	26	ralbidva 2486	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
28	1	rexeqdv 2693	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
29	1, 28	raleqbidv 2698	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∀𝑦 ∈ (Base‘𝐾)∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
30	2	rexeqdv 2693	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿) ↔ ∃𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
31	2, 30	raleqbidv 2698	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿) ↔ ∀𝑦 ∈ (Base‘𝐿)∃𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
32	27, 29, 31	3bitr3d 218	. . 3 ⊢ (𝜑 → (∀𝑦 ∈ (Base‘𝐾)∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∀𝑦 ∈ (Base‘𝐿)∃𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
33	4, 32	anbi12d 473	. 2 ⊢ (𝜑 → ((𝐾 ∈ Mnd ∧ ∀𝑦 ∈ (Base‘𝐾)∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)) ↔ (𝐿 ∈ Mnd ∧ ∀𝑦 ∈ (Base‘𝐿)∃𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿))))
34		eqid 2189	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
35		eqid 2189	. . 3 ⊢ (+g‘𝐾) = (+g‘𝐾)
36		eqid 2189	. . 3 ⊢ (0g‘𝐾) = (0g‘𝐾)
37	34, 35, 36	isgrp 12917	. 2 ⊢ (𝐾 ∈ Grp ↔ (𝐾 ∈ Mnd ∧ ∀𝑦 ∈ (Base‘𝐾)∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
38		eqid 2189	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
39		eqid 2189	. . 3 ⊢ (+g‘𝐿) = (+g‘𝐿)
40		eqid 2189	. . 3 ⊢ (0g‘𝐿) = (0g‘𝐿)
41	38, 39, 40	isgrp 12917	. 2 ⊢ (𝐿 ∈ Grp ↔ (𝐿 ∈ Mnd ∧ ∀𝑦 ∈ (Base‘𝐿)∃𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
42	33, 37, 41	3bitr4g 223	1 ⊢ (𝜑 → (𝐾 ∈ Grp ↔ 𝐿 ∈ Grp))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2160  ∀wral 2468  ∃wrex 2469  Vcvv 2752  ‘cfv 5231  (class class class)co 5891  Basecbs 12480  +_gcplusg 12555  0_gc0g 12727  Mndcmnd 12843  Grpcgrp 12911

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-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2162  ax-14 2163  ax-ext 2171  ax-sep 4136  ax-pow 4189  ax-pr 4224  ax-un 4448  ax-cnex 7920  ax-resscn 7921  ax-1re 7923  ax-addrcl 7926

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2041  df-mo 2042  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-rab 2477  df-v 2754  df-sbc 2978  df-csb 3073  df-un 3148  df-in 3150  df-ss 3157  df-pw 3592  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-int 3860  df-br 4019  df-opab 4080  df-mpt 4081  df-id 4308  df-xp 4647  df-rel 4648  df-cnv 4649  df-co 4650  df-dm 4651  df-rn 4652  df-res 4653  df-iota 5193  df-fun 5233  df-fn 5234  df-fv 5239  df-riota 5847  df-ov 5894  df-inn 8938  df-2 8996  df-ndx 12483  df-slot 12484  df-base 12486  df-plusg 12568  df-0g 12729  df-mgm 12798  df-sgrp 12831  df-mnd 12844  df-grp 12914

This theorem is referenced by:  grpprop  12929  grppropstrg  12930  ghmpropd  13183  ablpropd  13196  ringpropd  13353  opprring  13390  opprsubgg  13395  lmodprop2d  13625  sralmod  13727