Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > resv1r | Structured version Visualization version GIF version |
Description: 1r is unaffected by scalar restriction. (Contributed by Thierry Arnoux, 6-Sep-2018.) |
Ref | Expression |
---|---|
resvbas.1 | ⊢ 𝐻 = (𝐺 ↾v 𝐴) |
resv1r.2 | ⊢ 1 = (1r‘𝐺) |
Ref | Expression |
---|---|
resv1r | ⊢ (𝐴 ∈ 𝑉 → 1 = (1r‘𝐻)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resvbas.1 | . . . . . 6 ⊢ 𝐻 = (𝐺 ↾v 𝐴) | |
2 | eqid 2821 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
3 | 1, 2 | resvbas 30900 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (Base‘𝐺) = (Base‘𝐻)) |
4 | 3 | eleq2d 2898 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑒 ∈ (Base‘𝐺) ↔ 𝑒 ∈ (Base‘𝐻))) |
5 | eqid 2821 | . . . . . . . . 9 ⊢ (.r‘𝐺) = (.r‘𝐺) | |
6 | 1, 5 | resvmulr 30903 | . . . . . . . 8 ⊢ (𝐴 ∈ 𝑉 → (.r‘𝐺) = (.r‘𝐻)) |
7 | 6 | oveqd 7167 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝑒(.r‘𝐺)𝑥) = (𝑒(.r‘𝐻)𝑥)) |
8 | 7 | eqeq1d 2823 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝑒(.r‘𝐺)𝑥) = 𝑥 ↔ (𝑒(.r‘𝐻)𝑥) = 𝑥)) |
9 | 6 | oveqd 7167 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → (𝑥(.r‘𝐺)𝑒) = (𝑥(.r‘𝐻)𝑒)) |
10 | 9 | eqeq1d 2823 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → ((𝑥(.r‘𝐺)𝑒) = 𝑥 ↔ (𝑥(.r‘𝐻)𝑒) = 𝑥)) |
11 | 8, 10 | anbi12d 632 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (((𝑒(.r‘𝐺)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐺)𝑒) = 𝑥) ↔ ((𝑒(.r‘𝐻)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐻)𝑒) = 𝑥))) |
12 | 3, 11 | raleqbidv 3402 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ (Base‘𝐺)((𝑒(.r‘𝐺)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐺)𝑒) = 𝑥) ↔ ∀𝑥 ∈ (Base‘𝐻)((𝑒(.r‘𝐻)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐻)𝑒) = 𝑥))) |
13 | 4, 12 | anbi12d 632 | . . 3 ⊢ (𝐴 ∈ 𝑉 → ((𝑒 ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ (Base‘𝐺)((𝑒(.r‘𝐺)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐺)𝑒) = 𝑥)) ↔ (𝑒 ∈ (Base‘𝐻) ∧ ∀𝑥 ∈ (Base‘𝐻)((𝑒(.r‘𝐻)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐻)𝑒) = 𝑥)))) |
14 | 13 | iotabidv 6334 | . 2 ⊢ (𝐴 ∈ 𝑉 → (℩𝑒(𝑒 ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ (Base‘𝐺)((𝑒(.r‘𝐺)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐺)𝑒) = 𝑥))) = (℩𝑒(𝑒 ∈ (Base‘𝐻) ∧ ∀𝑥 ∈ (Base‘𝐻)((𝑒(.r‘𝐻)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐻)𝑒) = 𝑥)))) |
15 | resv1r.2 | . . 3 ⊢ 1 = (1r‘𝐺) | |
16 | 2, 5, 15 | dfur2 19248 | . 2 ⊢ 1 = (℩𝑒(𝑒 ∈ (Base‘𝐺) ∧ ∀𝑥 ∈ (Base‘𝐺)((𝑒(.r‘𝐺)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐺)𝑒) = 𝑥))) |
17 | eqid 2821 | . . 3 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
18 | eqid 2821 | . . 3 ⊢ (.r‘𝐻) = (.r‘𝐻) | |
19 | eqid 2821 | . . 3 ⊢ (1r‘𝐻) = (1r‘𝐻) | |
20 | 17, 18, 19 | dfur2 19248 | . 2 ⊢ (1r‘𝐻) = (℩𝑒(𝑒 ∈ (Base‘𝐻) ∧ ∀𝑥 ∈ (Base‘𝐻)((𝑒(.r‘𝐻)𝑥) = 𝑥 ∧ (𝑥(.r‘𝐻)𝑒) = 𝑥))) |
21 | 14, 16, 20 | 3eqtr4g 2881 | 1 ⊢ (𝐴 ∈ 𝑉 → 1 = (1r‘𝐻)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ℩cio 6307 ‘cfv 6350 (class class class)co 7150 Basecbs 16477 .rcmulr 16560 1rcur 19245 ↾v cresv 30892 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-plusg 16572 df-mulr 16573 df-sca 16575 df-0g 16709 df-mgp 19234 df-ur 19246 df-resv 30893 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |