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 16900. (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 16882 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
4 | cnvcnv2 6094 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
5 | 4 | fveq1i 6770 | . . . 4 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
6 | fvex 6782 | . . . . 5 ⊢ (𝐸‘ndx) ∈ V | |
7 | fvres 6788 | . . . . 5 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
9 | 5, 8 | eqtri 2768 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
10 | strfv2d.f | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) | |
11 | strfv2d.n | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
12 | strfv2d.c | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
13 | 12 | elexd 3451 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ V) |
14 | opelxpi 5626 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ V ∧ 𝐶 ∈ V) → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) | |
15 | 6, 13, 14 | sylancr 587 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
16 | 11, 15 | elind 4133 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
17 | cnvcnv 6093 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
18 | 16, 17 | eleqtrrdi 2852 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
19 | funopfv 6816 | . . . 4 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
20 | 10, 18, 19 | sylc 65 | . . 3 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
21 | 9, 20 | eqtr3id 2794 | . 2 ⊢ (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶) |
22 | 3, 21 | eqtr2d 2781 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2110 Vcvv 3431 ∩ cin 3891 〈cop 4573 × cxp 5587 ◡ccnv 5588 ↾ cres 5591 Fun wfun 6425 ‘cfv 6431 Slot cslot 16878 ndxcnx 16890 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pr 5356 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ral 3071 df-rex 3072 df-rab 3075 df-v 3433 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-res 5601 df-iota 6389 df-fun 6433 df-fv 6439 df-slot 16879 |
This theorem is referenced by: strfv2 16900 opelstrbas 16922 ebtwntg 27346 ecgrtg 27347 elntg 27348 edgfiedgval 27383 |
Copyright terms: Public domain | W3C validator |