| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > grppropstrg | GIF version | ||
| Description: Generalize a specific 2-element group 𝐿 to show that any set 𝐾 with the same (relevant) properties is also a group. (Contributed by NM, 28-Oct-2012.) (Revised by Mario Carneiro, 6-Jan-2015.) |
| Ref | Expression |
|---|---|
| grppropstr.b | ⊢ (Base‘𝐾) = 𝐵 |
| grppropstr.p | ⊢ (+g‘𝐾) = + |
| grppropstr.l | ⊢ 𝐿 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} |
| Ref | Expression |
|---|---|
| grppropstrg | ⊢ (𝐾 ∈ 𝑉 → (𝐾 ∈ Grp ↔ 𝐿 ∈ Grp)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grppropstr.b | . . . . 5 ⊢ (Base‘𝐾) = 𝐵 | |
| 2 | basfn 13413 | . . . . . 6 ⊢ Base Fn V | |
| 3 | elex 2833 | . . . . . 6 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V) | |
| 4 | funfvex 5712 | . . . . . . 7 ⊢ ((Fun Base ∧ 𝐾 ∈ dom Base) → (Base‘𝐾) ∈ V) | |
| 5 | 4 | funfni 5483 | . . . . . 6 ⊢ ((Base Fn V ∧ 𝐾 ∈ V) → (Base‘𝐾) ∈ V) |
| 6 | 2, 3, 5 | sylancr 418 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → (Base‘𝐾) ∈ V) |
| 7 | 1, 6 | eqeltrrid 2326 | . . . 4 ⊢ (𝐾 ∈ 𝑉 → 𝐵 ∈ V) |
| 8 | grppropstr.p | . . . . 5 ⊢ (+g‘𝐾) = + | |
| 9 | plusgslid 13468 | . . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 10 | 9 | slotex 13381 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → (+g‘𝐾) ∈ V) |
| 11 | 8, 10 | eqeltrrid 2326 | . . . 4 ⊢ (𝐾 ∈ 𝑉 → + ∈ V) |
| 12 | grppropstr.l | . . . . 5 ⊢ 𝐿 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} | |
| 13 | 12 | grpbaseg 13483 | . . . 4 ⊢ ((𝐵 ∈ V ∧ + ∈ V) → 𝐵 = (Base‘𝐿)) |
| 14 | 7, 11, 13 | syl2anc 415 | . . 3 ⊢ (𝐾 ∈ 𝑉 → 𝐵 = (Base‘𝐿)) |
| 15 | 1, 14 | eqtrid 2283 | . . 3 ⊢ (𝐾 ∈ 𝑉 → (Base‘𝐾) = (Base‘𝐿)) |
| 16 | 14, 15 | eqtr4d 2274 | . 2 ⊢ (𝐾 ∈ 𝑉 → 𝐵 = (Base‘𝐾)) |
| 17 | 12 | grpplusgg 13484 | . . . . 5 ⊢ ((𝐵 ∈ V ∧ + ∈ V) → + = (+g‘𝐿)) |
| 18 | 7, 11, 17 | syl2anc 415 | . . . 4 ⊢ (𝐾 ∈ 𝑉 → + = (+g‘𝐿)) |
| 19 | 8, 18 | eqtrid 2283 | . . 3 ⊢ (𝐾 ∈ 𝑉 → (+g‘𝐾) = (+g‘𝐿)) |
| 20 | 19 | oveqdr 6113 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
| 21 | 16, 14, 20 | grppropd 13824 | 1 ⊢ (𝐾 ∈ 𝑉 → (𝐾 ∈ Grp ↔ 𝐿 ∈ Grp)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 Vcvv 2821 {cpr 3710 〈cop 3712 Fn wfn 5372 ‘cfv 5377 ndxcnx 13351 Basecbs 13354 +gcplusg 13433 Grpcgrp 13807 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-pre-ltirr 8291 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-iota 5337 df-fun 5379 df-fn 5380 df-fv 5385 df-riota 6038 df-ov 6088 df-pnf 8362 df-mnf 8363 df-ltxr 8365 df-inn 9306 df-2 9364 df-ndx 13357 df-slot 13358 df-base 13360 df-plusg 13446 df-0g 13614 df-mgm 13678 df-sgrp 13719 df-mnd 13732 df-grp 13810 |
| This theorem is used by: ring1 14366 |
| Copyright terms: Public domain | W3C validator |