| 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 13134 | . . . . . 6 ⊢ Base Fn V | |
| 3 | elex 2812 | . . . . . 6 ⊢ (𝐾 ∈ 𝑉 → 𝐾 ∈ V) | |
| 4 | funfvex 5652 | . . . . . . 7 ⊢ ((Fun Base ∧ 𝐾 ∈ dom Base) → (Base‘𝐾) ∈ V) | |
| 5 | 4 | funfni 5429 | . . . . . 6 ⊢ ((Base Fn V ∧ 𝐾 ∈ V) → (Base‘𝐾) ∈ V) |
| 6 | 2, 3, 5 | sylancr 414 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → (Base‘𝐾) ∈ V) |
| 7 | 1, 6 | eqeltrrid 2317 | . . . 4 ⊢ (𝐾 ∈ 𝑉 → 𝐵 ∈ V) |
| 8 | grppropstr.p | . . . . 5 ⊢ (+g‘𝐾) = + | |
| 9 | plusgslid 13188 | . . . . . 6 ⊢ (+g = Slot (+g‘ndx) ∧ (+g‘ndx) ∈ ℕ) | |
| 10 | 9 | slotex 13102 | . . . . 5 ⊢ (𝐾 ∈ 𝑉 → (+g‘𝐾) ∈ V) |
| 11 | 8, 10 | eqeltrrid 2317 | . . . 4 ⊢ (𝐾 ∈ 𝑉 → + ∈ V) |
| 12 | grppropstr.l | . . . . 5 ⊢ 𝐿 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} | |
| 13 | 12 | grpbaseg 13203 | . . . 4 ⊢ ((𝐵 ∈ V ∧ + ∈ V) → 𝐵 = (Base‘𝐿)) |
| 14 | 7, 11, 13 | syl2anc 411 | . . 3 ⊢ (𝐾 ∈ 𝑉 → 𝐵 = (Base‘𝐿)) |
| 15 | 1, 14 | eqtrid 2274 | . . 3 ⊢ (𝐾 ∈ 𝑉 → (Base‘𝐾) = (Base‘𝐿)) |
| 16 | 14, 15 | eqtr4d 2265 | . 2 ⊢ (𝐾 ∈ 𝑉 → 𝐵 = (Base‘𝐾)) |
| 17 | 12 | grpplusgg 13204 | . . . . 5 ⊢ ((𝐵 ∈ V ∧ + ∈ V) → + = (+g‘𝐿)) |
| 18 | 7, 11, 17 | syl2anc 411 | . . . 4 ⊢ (𝐾 ∈ 𝑉 → + = (+g‘𝐿)) |
| 19 | 8, 18 | eqtrid 2274 | . . 3 ⊢ (𝐾 ∈ 𝑉 → (+g‘𝐾) = (+g‘𝐿)) |
| 20 | 19 | oveqdr 6041 | . 2 ⊢ ((𝐾 ∈ 𝑉 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
| 21 | 16, 14, 20 | grppropd 13593 | 1 ⊢ (𝐾 ∈ 𝑉 → (𝐾 ∈ Grp ↔ 𝐿 ∈ Grp)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 Vcvv 2800 {cpr 3668 〈cop 3670 Fn wfn 5319 ‘cfv 5324 ndxcnx 13072 Basecbs 13075 +gcplusg 13153 Grpcgrp 13576 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-addcom 8125 ax-addass 8127 ax-i2m1 8130 ax-0lt1 8131 ax-0id 8133 ax-rnegex 8134 ax-pre-ltirr 8137 ax-pre-ltadd 8141 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-iota 5284 df-fun 5326 df-fn 5327 df-fv 5332 df-riota 5966 df-ov 6016 df-pnf 8209 df-mnf 8210 df-ltxr 8212 df-inn 9137 df-2 9195 df-ndx 13078 df-slot 13079 df-base 13081 df-plusg 13166 df-0g 13334 df-mgm 13432 df-sgrp 13478 df-mnd 13493 df-grp 13579 |
| This theorem is referenced by: ring1 14065 |
| Copyright terms: Public domain | W3C validator |