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 16546 | . . . . . 6 ⊢ (((Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = 𝑊) |
4 | 3 | fveq2d 6669 | . . . . 5 ⊢ (((Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊)) |
5 | 4 | 3expib 1118 | . . . 4 ⊢ ((Base‘𝑊) ⊆ 𝐴 → ((𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘𝑊))) |
6 | 1, 2 | ressval2 16547 | . . . . . . 7 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → 𝑅 = (𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉)) |
7 | 6 | fveq2d 6669 | . . . . . 6 ⊢ ((¬ (Base‘𝑊) ⊆ 𝐴 ∧ 𝑊 ∈ V ∧ 𝐴 ∈ 𝑉) → (𝐸‘𝑅) = (𝐸‘(𝑊 sSet 〈(Base‘ndx), (𝐴 ∩ (Base‘𝑊))〉))) |
8 | resslem.f | . . . . . . . 8 ⊢ 𝐸 = Slot 𝑁 | |
9 | resslem.n | . . . . . . . 8 ⊢ 𝑁 ∈ ℕ | |
10 | 8, 9 | ndxid 16503 | . . . . . . 7 ⊢ 𝐸 = Slot (𝐸‘ndx) |
11 | 8, 9 | ndxarg 16502 | . . . . . . . . 9 ⊢ (𝐸‘ndx) = 𝑁 |
12 | 1re 10635 | . . . . . . . . . 10 ⊢ 1 ∈ ℝ | |
13 | resslem.b | . . . . . . . . . 10 ⊢ 1 < 𝑁 | |
14 | 12, 13 | gtneii 10746 | . . . . . . . . 9 ⊢ 𝑁 ≠ 1 |
15 | 11, 14 | eqnetri 3086 | . . . . . . . 8 ⊢ (𝐸‘ndx) ≠ 1 |
16 | basendx 16541 | . . . . . . . 8 ⊢ (Base‘ndx) = 1 | |
17 | 15, 16 | neeqtrri 3089 | . . . . . . 7 ⊢ (𝐸‘ndx) ≠ (Base‘ndx) |
18 | 10, 17 | setsnid 16533 | . . . . . 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 16544 | . . . . . . . . 9 ⊢ Rel dom ↾s | |
23 | 22 | ovprc1 7189 | . . . . . . . 8 ⊢ (¬ 𝑊 ∈ V → (𝑊 ↾s 𝐴) = ∅) |
24 | 1, 23 | syl5eq 2868 | . . . . . . 7 ⊢ (¬ 𝑊 ∈ V → 𝑅 = ∅) |
25 | 24 | fveq2d 6669 | . . . . . 6 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = (𝐸‘∅)) |
26 | 8 | str0 16529 | . . . . . 6 ⊢ ∅ = (𝐸‘∅) |
27 | 25, 26 | syl6eqr 2874 | . . . . 5 ⊢ (¬ 𝑊 ∈ V → (𝐸‘𝑅) = ∅) |
28 | fvprc 6658 | . . . . 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 1533 ∈ wcel 2110 Vcvv 3495 ∩ cin 3935 ⊆ wss 3936 ∅c0 4291 〈cop 4567 class class class wbr 5059 ‘cfv 6350 (class class class)co 7150 1c1 10532 < clt 10669 ℕcn 11632 ndxcnx 16474 sSet csts 16475 Slot cslot 16476 Basecbs 16477 ↾s cress 16478 |
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-mulcl 10593 ax-mulrcl 10594 ax-i2m1 10599 ax-1ne0 10600 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 |
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-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-ltxr 10674 df-nn 11633 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 |
This theorem is referenced by: ressplusg 16606 ressmulr 16619 ressstarv 16620 resssca 16644 ressvsca 16645 ressip 16646 resstset 16659 ressle 16666 ressds 16680 resshom 16685 ressco 16686 ressunif 22865 |
Copyright terms: Public domain | W3C validator |