Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > resslem | Structured version Visualization version GIF version |
Description: Other elements of a structure restriction. (Contributed by Mario Carneiro, 26-Nov-2014.) (Revised by Mario Carneiro, 2-Dec-2014.) |
Ref | Expression |
---|---|
resslem.r | ⊢ 𝑅 = (𝑊 ↾s 𝐴) |
resslem.e | ⊢ 𝐶 = (𝐸‘𝑊) |
resslem.f | ⊢ 𝐸 = Slot 𝑁 |
resslem.n | ⊢ 𝑁 ∈ ℕ |
resslem.b | ⊢ 1 < 𝑁 |
Ref | Expression |
---|---|
resslem | ⊢ (𝐴 ∈ 𝑉 → 𝐶 = (𝐸‘𝑅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resslem.r | . . . . . . 7 ⊢ 𝑅 = (𝑊 ↾s 𝐴) | |
2 | eqid 2622 | . . . . . . 7 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
3 | 1, 2 | ressid2 15928 | . . . . . 6 ⊢ (((Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = 𝑊) |
4 | 3 | fveq2d 6195 | . . . . 5 ⊢ (((Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
5 | 4 | 3expib 1268 | . . . 4 ⊢ ((Base‘𝑊) ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊))) |
6 | 1, 2 | ressval2 15929 | . . . . . . 7 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
7 | 6 | fveq2d 6195 | . . . . . 6 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
8 | resslem.f | . . . . . . . 8 ⊢ 𝐸 = Slot 𝑁 | |
9 | resslem.n | . . . . . . . 8 ⊢ 𝑁 ∈ ℕ | |
10 | 8, 9 | ndxid 15883 | . . . . . . 7 ⊢ 𝐸 = Slot (𝐸‘ndx) |
11 | 8, 9 | ndxarg 15882 | . . . . . . . . 9 ⊢ (𝐸‘ndx) = 𝑁 |
12 | 1re 10039 | . . . . . . . . . 10 ⊢ 1 ∈ ℝ | |
13 | resslem.b | . . . . . . . . . 10 ⊢ 1 < 𝑁 | |
14 | 12, 13 | gtneii 10149 | . . . . . . . . 9 ⊢ 𝑁 ≠ 1 |
15 | 11, 14 | eqnetri 2864 | . . . . . . . 8 ⊢ (𝐸‘ndx) ≠ 1 |
16 | basendx 15923 | . . . . . . . 8 ⊢ (Base‘ndx) = 1 | |
17 | 15, 16 | neeqtrri 2867 | . . . . . . 7 ⊢ (𝐸‘ndx) ≠ (Base‘ndx) |
18 | 10, 17 | setsnid 15915 | . . . . . 6 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
19 | 7, 18 | syl6eqr 2674 | . . . . 5 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
20 | 19 | 3expib 1268 | . . . 4 ⊢ (¬ (Base‘𝑊) ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊))) |
21 | 5, 20 | pm2.61i 176 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
22 | reldmress 15926 | . . . . . . . . 9 ⊢ Rel dom ↾s | |
23 | 22 | ovprc1 6684 | . . . . . . . 8 ⊢ (¬ 𝑊 ∈ V → (𝑊 ↾s 𝐴) = ∅) |
24 | 1, 23 | syl5eq 2668 | . . . . . . 7 ⊢ (¬ 𝑊 ∈ V → 𝑅 = ∅) |
25 | 24 | fveq2d 6195 | . . . . . 6 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = (𝐸‘∅)) |
26 | 8 | str0 15911 | . . . . . 6 ⊢ ∅ = (𝐸‘∅) |
27 | 25, 26 | syl6eqr 2674 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = ∅) |
28 | fvprc 6185 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅) | |
29 | 27, 28 | eqtr4d 2659 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = (𝐸‘𝑊)) |
30 | 29 | adantr 481 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
31 | 21, 30 | pm2.61ian 831 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐸‘𝑅) = (𝐸‘𝑊)) |
32 | resslem.e | . 2 ⊢ 𝐶 = (𝐸‘𝑊) | |
33 | 31, 32 | syl6reqr 2675 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐶 = (𝐸‘𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ∩ cin 3573 ⊆ wss 3574 ∅c0 3915 〈cop 4183 class class class wbr 4653 ‘cfv 5888 (class class class)co 6650 1c1 9937 < clt 10074 ℕcn 11020 ndxcnx 15854 sSet csts 15855 Slot cslot 15856 Basecbs 15857 ↾s cress 15858 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-i2m1 10004 ax-1ne0 10005 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-pnf 10076 df-mnf 10077 df-ltxr 10079 df-nn 11021 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 |
This theorem is referenced by: ressplusg 15993 ressmulr 16006 ressstarv 16007 resssca 16031 ressvsca 16032 ressip 16033 resstset 16046 ressle 16059 ressds 16073 resshom 16078 ressco 16079 ressunif 22066 |
Copyright terms: Public domain | W3C validator |