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 2821 | . . . . . . 7 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
3 | 1, 2 | ressid2 16552 | . . . . . 6 ⊢ (((Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = 𝑊) |
4 | 3 | fveq2d 6674 | . . . . 5 ⊢ (((Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
5 | 4 | 3expib 1118 | . . . 4 ⊢ ((Base‘𝑊) ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊))) |
6 | 1, 2 | ressval2 16553 | . . . . . . 7 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
7 | 6 | fveq2d 6674 | . . . . . 6 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
8 | resslem.f | . . . . . . . 8 ⊢ 𝐸 = Slot 𝑁 | |
9 | resslem.n | . . . . . . . 8 ⊢ 𝑁 ∈ ℕ | |
10 | 8, 9 | ndxid 16509 | . . . . . . 7 ⊢ 𝐸 = Slot (𝐸‘ndx) |
11 | 8, 9 | ndxarg 16508 | . . . . . . . . 9 ⊢ (𝐸‘ndx) = 𝑁 |
12 | 1re 10641 | . . . . . . . . . 10 ⊢ 1 ∈ ℝ | |
13 | resslem.b | . . . . . . . . . 10 ⊢ 1 < 𝑁 | |
14 | 12, 13 | gtneii 10752 | . . . . . . . . 9 ⊢ 𝑁 ≠ 1 |
15 | 11, 14 | eqnetri 3086 | . . . . . . . 8 ⊢ (𝐸‘ndx) ≠ 1 |
16 | basendx 16547 | . . . . . . . 8 ⊢ (Base‘ndx) = 1 | |
17 | 15, 16 | neeqtrri 3089 | . . . . . . 7 ⊢ (𝐸‘ndx) ≠ (Base‘ndx) |
18 | 10, 17 | setsnid 16539 | . . . . . 6 ⊢ (𝐸‘𝑊) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
19 | 7, 18 | syl6eqr 2874 | . . . . 5 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
20 | 19 | 3expib 1118 | . . . 4 ⊢ (¬ (Base‘𝑊) ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊))) |
21 | 5, 20 | pm2.61i 184 | . . 3 ⊢ ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
22 | reldmress 16550 | . . . . . . . . 9 ⊢ Rel dom ↾s | |
23 | 22 | ovprc1 7195 | . . . . . . . 8 ⊢ (¬ 𝑊 ∈ V → (𝑊 ↾s 𝐴) = ∅) |
24 | 1, 23 | syl5eq 2868 | . . . . . . 7 ⊢ (¬ 𝑊 ∈ V → 𝑅 = ∅) |
25 | 24 | fveq2d 6674 | . . . . . 6 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = (𝐸‘∅)) |
26 | 8 | str0 16535 | . . . . . 6 ⊢ ∅ = (𝐸‘∅) |
27 | 25, 26 | syl6eqr 2874 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = ∅) |
28 | fvprc 6663 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑊) = ∅) | |
29 | 27, 28 | eqtr4d 2859 | . . . 4 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = (𝐸‘𝑊)) |
30 | 29 | adantr 483 | . . 3 ⊢ ((¬ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
31 | 21, 30 | pm2.61ian 810 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝐸‘𝑅) = (𝐸‘𝑊)) |
32 | resslem.e | . 2 ⊢ 𝐶 = (𝐸‘𝑊) | |
33 | 31, 32 | syl6reqr 2875 | 1 ⊢ (𝐴 ∈ 𝑉 → 𝐶 = (𝐸‘𝑅)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3494 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 〈cop 4573 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 1c1 10538 < clt 10675 ℕcn 11638 ndxcnx 16480 sSet csts 16481 Slot cslot 16482 Basecbs 16483 ↾s cress 16484 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-mulcl 10599 ax-mulrcl 10600 ax-i2m1 10605 ax-1ne0 10606 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 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 3496 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 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-ov 7159 df-oprab 7160 df-mpo 7161 df-om 7581 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-ltxr 10680 df-nn 11639 df-ndx 16486 df-slot 16487 df-base 16489 df-sets 16490 df-ress 16491 |
This theorem is referenced by: ressplusg 16612 ressmulr 16625 ressstarv 16626 resssca 16650 ressvsca 16651 ressip 16652 resstset 16665 ressle 16672 ressds 16686 resshom 16691 ressco 16692 ressunif 22871 |
Copyright terms: Public domain | W3C validator |