![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > grp1inv | GIF version |
Description: The inverse function of the trivial group. (Contributed by FL, 21-Jun-2010.) (Revised by AV, 26-Aug-2021.) |
Ref | Expression |
---|---|
grp1.m | ⊢ 𝑀 = {〈(Base‘ndx), {𝐼}〉, 〈(+g‘ndx), {〈〈𝐼, 𝐼〉, 𝐼〉}〉} |
Ref | Expression |
---|---|
grp1inv | ⊢ (𝐼 ∈ 𝑉 → (invg‘𝑀) = ( I ↾ {𝐼})) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | grp1.m | . . . . 5 ⊢ 𝑀 = {〈(Base‘ndx), {𝐼}〉, 〈(+g‘ndx), {〈〈𝐼, 𝐼〉, 𝐼〉}〉} | |
2 | 1 | grp1 13178 | . . . 4 ⊢ (𝐼 ∈ 𝑉 → 𝑀 ∈ Grp) |
3 | eqid 2193 | . . . . 5 ⊢ (Base‘𝑀) = (Base‘𝑀) | |
4 | eqid 2193 | . . . . 5 ⊢ (invg‘𝑀) = (invg‘𝑀) | |
5 | 3, 4 | grpinvf 13119 | . . . 4 ⊢ (𝑀 ∈ Grp → (invg‘𝑀):(Base‘𝑀)⟶(Base‘𝑀)) |
6 | 2, 5 | syl 14 | . . 3 ⊢ (𝐼 ∈ 𝑉 → (invg‘𝑀):(Base‘𝑀)⟶(Base‘𝑀)) |
7 | snexg 4213 | . . . . 5 ⊢ (𝐼 ∈ 𝑉 → {𝐼} ∈ V) | |
8 | opexg 4257 | . . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐼 ∈ 𝑉) → 〈𝐼, 𝐼〉 ∈ V) | |
9 | 8 | anidms 397 | . . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → 〈𝐼, 𝐼〉 ∈ V) |
10 | opexg 4257 | . . . . . . 7 ⊢ ((〈𝐼, 𝐼〉 ∈ V ∧ 𝐼 ∈ 𝑉) → 〈〈𝐼, 𝐼〉, 𝐼〉 ∈ V) | |
11 | 9, 10 | mpancom 422 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → 〈〈𝐼, 𝐼〉, 𝐼〉 ∈ V) |
12 | snexg 4213 | . . . . . 6 ⊢ (〈〈𝐼, 𝐼〉, 𝐼〉 ∈ V → {〈〈𝐼, 𝐼〉, 𝐼〉} ∈ V) | |
13 | 11, 12 | syl 14 | . . . . 5 ⊢ (𝐼 ∈ 𝑉 → {〈〈𝐼, 𝐼〉, 𝐼〉} ∈ V) |
14 | 1 | grpbaseg 12744 | . . . . 5 ⊢ (({𝐼} ∈ V ∧ {〈〈𝐼, 𝐼〉, 𝐼〉} ∈ V) → {𝐼} = (Base‘𝑀)) |
15 | 7, 13, 14 | syl2anc 411 | . . . 4 ⊢ (𝐼 ∈ 𝑉 → {𝐼} = (Base‘𝑀)) |
16 | 15, 15 | feq23d 5399 | . . 3 ⊢ (𝐼 ∈ 𝑉 → ((invg‘𝑀):{𝐼}⟶{𝐼} ↔ (invg‘𝑀):(Base‘𝑀)⟶(Base‘𝑀))) |
17 | 6, 16 | mpbird 167 | . 2 ⊢ (𝐼 ∈ 𝑉 → (invg‘𝑀):{𝐼}⟶{𝐼}) |
18 | fsng 5731 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐼 ∈ 𝑉) → ((invg‘𝑀):{𝐼}⟶{𝐼} ↔ (invg‘𝑀) = {〈𝐼, 𝐼〉})) | |
19 | 18 | anidms 397 | . . 3 ⊢ (𝐼 ∈ 𝑉 → ((invg‘𝑀):{𝐼}⟶{𝐼} ↔ (invg‘𝑀) = {〈𝐼, 𝐼〉})) |
20 | simpr 110 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ (invg‘𝑀) = {〈𝐼, 𝐼〉}) → (invg‘𝑀) = {〈𝐼, 𝐼〉}) | |
21 | restidsing 4998 | . . . . . . 7 ⊢ ( I ↾ {𝐼}) = ({𝐼} × {𝐼}) | |
22 | xpsng 5733 | . . . . . . . 8 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝐼 ∈ 𝑉) → ({𝐼} × {𝐼}) = {〈𝐼, 𝐼〉}) | |
23 | 22 | anidms 397 | . . . . . . 7 ⊢ (𝐼 ∈ 𝑉 → ({𝐼} × {𝐼}) = {〈𝐼, 𝐼〉}) |
24 | 21, 23 | eqtr2id 2239 | . . . . . 6 ⊢ (𝐼 ∈ 𝑉 → {〈𝐼, 𝐼〉} = ( I ↾ {𝐼})) |
25 | 24 | adantr 276 | . . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ (invg‘𝑀) = {〈𝐼, 𝐼〉}) → {〈𝐼, 𝐼〉} = ( I ↾ {𝐼})) |
26 | 20, 25 | eqtrd 2226 | . . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (invg‘𝑀) = {〈𝐼, 𝐼〉}) → (invg‘𝑀) = ( I ↾ {𝐼})) |
27 | 26 | ex 115 | . . 3 ⊢ (𝐼 ∈ 𝑉 → ((invg‘𝑀) = {〈𝐼, 𝐼〉} → (invg‘𝑀) = ( I ↾ {𝐼}))) |
28 | 19, 27 | sylbid 150 | . 2 ⊢ (𝐼 ∈ 𝑉 → ((invg‘𝑀):{𝐼}⟶{𝐼} → (invg‘𝑀) = ( I ↾ {𝐼}))) |
29 | 17, 28 | mpd 13 | 1 ⊢ (𝐼 ∈ 𝑉 → (invg‘𝑀) = ( I ↾ {𝐼})) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1364 ∈ wcel 2164 Vcvv 2760 {csn 3618 {cpr 3619 〈cop 3621 I cid 4319 × cxp 4657 ↾ cres 4661 ⟶wf 5250 ‘cfv 5254 ndxcnx 12615 Basecbs 12618 +gcplusg 12695 Grpcgrp 13072 invgcminusg 13073 |
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 615 ax-in2 616 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 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-pre-ltirr 7984 ax-pre-ltadd 7988 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-pnf 8056 df-mnf 8057 df-ltxr 8059 df-inn 8983 df-2 9041 df-ndx 12621 df-slot 12622 df-base 12624 df-plusg 12708 df-0g 12869 df-mgm 12939 df-sgrp 12985 df-mnd 12998 df-grp 13075 df-minusg 13076 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |