Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > strfv2d | Structured version Visualization version GIF version |
Description: Deduction version of strfv2 16524. (Contributed by Mario Carneiro, 30-Apr-2015.) |
Ref | Expression |
---|---|
strfv2d.e | ⊢ 𝐸 = Slot (𝐸‘ndx) |
strfv2d.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
strfv2d.f | ⊢ (𝜑 → Fun ◡◡𝑆) |
strfv2d.n | ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
strfv2d.c | ⊢ (𝜑 → 𝐶 ∈ 𝑊) |
Ref | Expression |
---|---|
strfv2d | ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | strfv2d.e | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
2 | strfv2d.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
3 | 1, 2 | strfvnd 16496 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
4 | cnvcnv2 6045 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
5 | 4 | fveq1i 6666 | . . . 4 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
6 | fvex 6678 | . . . . 5 ⊢ (𝐸‘ndx) ∈ V | |
7 | fvres 6684 | . . . . 5 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
9 | 5, 8 | eqtri 2844 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
10 | strfv2d.f | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) | |
11 | strfv2d.n | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
12 | strfv2d.c | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
13 | 12 | elexd 3515 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ V) |
14 | opelxpi 5587 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ V ∧ 𝐶 ∈ V) → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) | |
15 | 6, 13, 14 | sylancr 589 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
16 | 11, 15 | elind 4171 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
17 | cnvcnv 6044 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
18 | 16, 17 | eleqtrrdi 2924 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
19 | funopfv 6712 | . . . 4 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
20 | 10, 18, 19 | sylc 65 | . . 3 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
21 | 9, 20 | syl5eqr 2870 | . 2 ⊢ (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶) |
22 | 3, 21 | eqtr2d 2857 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2110 Vcvv 3495 ∩ cin 3935 〈cop 4567 × cxp 5548 ◡ccnv 5549 ↾ cres 5552 Fun wfun 6344 ‘cfv 6350 ndxcnx 16474 Slot cslot 16476 |
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-pr 5322 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 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-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-res 5562 df-iota 6309 df-fun 6352 df-fv 6358 df-slot 16481 |
This theorem is referenced by: strfv2 16524 opelstrbas 16591 ebtwntg 26762 ecgrtg 26763 elntg 26764 edgfiedgval 26796 |
Copyright terms: Public domain | W3C validator |