Theorem grppropd 13814

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 13737	. . 3 ⊢ (𝜑 → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd))
5	1	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐵 = (Base‘𝐾))
6	2	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐵 = (Base‘𝐿))
7		simprl 531	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑥 ∈ 𝐵)
8	5, 7	basmexd 13357	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐾 ∈ V)
9	6, 7	basmexd 13357	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐿 ∈ V)
10	3	ralrimivva 2626	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
11		oveq1 6065	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → (𝑥(+g‘𝐾)𝑦) = (𝑧(+g‘𝐾)𝑦))
12		oveq1 6065	. . . . . . . . . . . . . . . 16 ⊢ (𝑥 = 𝑧 → (𝑥(+g‘𝐿)𝑦) = (𝑧(+g‘𝐿)𝑦))
13	11, 12	eqeq12d 2249	. . . . . . . . . . . . . . 15 ⊢ (𝑥 = 𝑧 → ((𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) ↔ (𝑧(+g‘𝐾)𝑦) = (𝑧(+g‘𝐿)𝑦)))
14		oveq2 6066	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑤 → (𝑧(+g‘𝐾)𝑦) = (𝑧(+g‘𝐾)𝑤))
15		oveq2 6066	. . . . . . . . . . . . . . . 16 ⊢ (𝑦 = 𝑤 → (𝑧(+g‘𝐿)𝑦) = (𝑧(+g‘𝐿)𝑤))
16	14, 15	eqeq12d 2249	. . . . . . . . . . . . . . 15 ⊢ (𝑦 = 𝑤 → ((𝑧(+g‘𝐾)𝑦) = (𝑧(+g‘𝐿)𝑦) ↔ (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤)))
17	13, 16	cbvral2v 2793	. . . . . . . . . . . . . 14 ⊢ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) ↔ ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
18	10, 17	sylib 122	. . . . . . . . . . . . 13 ⊢ (𝜑 → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
19	18	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
20	19	r19.21bi 2632	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) → ∀𝑤 ∈ 𝐵 (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
21	20	r19.21bi 2632	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ 𝑧 ∈ 𝐵) ∧ 𝑤 ∈ 𝐵) → (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
22	21	anasss 399	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧(+g‘𝐾)𝑤) = (𝑧(+g‘𝐿)𝑤))
23	5, 6, 8, 9, 22	grpidpropdg 13671	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (0g‘𝐾) = (0g‘𝐿))
24	3, 23	eqeq12d 2249	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
25	24	anass1rs 573	. . . . . 6 ⊢ (((𝜑 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 ∈ 𝐵) → ((𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
26	25	rexbidva 2541	. . . . 5 ⊢ ((𝜑 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
27	26	ralbidva 2540	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
28	1	rexeqdv 2750	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
29	1, 28	raleqbidv 2759	. . . 4 ⊢ (𝜑 → (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐾)𝑦) = (0g‘𝐾) ↔ ∀𝑦 ∈ (Base‘𝐾)∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
30	2	rexeqdv 2750	. . . . 5 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 (𝑥(+g‘𝐿)𝑦) = (0g‘𝐿) ↔ ∃𝑥 ∈ (Base‘𝐿)(𝑥(+g‘𝐿)𝑦) = (0g‘𝐿)))
31	2, 30	raleqbidv 2759	. . . 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 2234	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
35		eqid 2234	. . 3 ⊢ (+g‘𝐾) = (+g‘𝐾)
36		eqid 2234	. . 3 ⊢ (0g‘𝐾) = (0g‘𝐾)
37	34, 35, 36	isgrp 13803	. 2 ⊢ (𝐾 ∈ Grp ↔ (𝐾 ∈ Mnd ∧ ∀𝑦 ∈ (Base‘𝐾)∃𝑥 ∈ (Base‘𝐾)(𝑥(+g‘𝐾)𝑦) = (0g‘𝐾)))
38		eqid 2234	. . 3 ⊢ (Base‘𝐿) = (Base‘𝐿)
39		eqid 2234	. . 3 ⊢ (+g‘𝐿) = (+g‘𝐿)
40		eqid 2234	. . 3 ⊢ (0g‘𝐿) = (0g‘𝐿)
41	38, 39, 40	isgrp 13803	. 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 1398   ∈ wcel 2205  ∀wral 2522  ∃wrex 2523  Vcvv 2815  ‘cfv 5357  (class class class)co 6058  Basecbs 13296  +_gcplusg 13374  0_gc0g 13553  Mndcmnd 13713  Grpcgrp 13797

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-0g 13555  df-mgm 13653  df-sgrp 13699  df-mnd 13714  df-grp 13800

This theorem is referenced by:  grpprop  13815  grppropstrg  13816  ghmpropd  14084  ablpropd  14097  ringpropd  14266  opprring  14307  opprsubgg  14313  lmodprop2d  14608  sralmod  14710  psrgrp  14952