| 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 17257. (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 17240 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
| 4 | cnvcnv2 6191 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
| 5 | 4 | fveq1i 6882 | . . . 4 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
| 6 | fvex 6894 | . . . . 5 ⊢ (𝐸‘ndx) ∈ V | |
| 7 | fvres 6900 | . . . . 5 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
| 9 | 5, 8 | eqtri 2786 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
| 10 | strfv2d.f | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) | |
| 11 | strfv2d.n | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
| 12 | strfv2d.c | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 13 | 12 | elexd 3478 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ V) |
| 14 | opelxpi 5698 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ V ∧ 𝐶 ∈ V) → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) | |
| 15 | 6, 13, 14 | sylancr 598 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
| 16 | 11, 15 | elind 4153 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
| 17 | cnvcnv 6190 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
| 18 | 16, 17 | eleqtrrdi 2874 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
| 19 | funopfv 6930 | . . . 4 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
| 20 | 10, 18, 19 | sylc 66 | . . 3 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
| 21 | 9, 20 | eqtr3id 2812 | . 2 ⊢ (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶) |
| 22 | 3, 21 | eqtr2d 2799 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∩ cin 3904 〈cop 4595 × cxp 5659 ◡ccnv 5660 ↾ cres 5663 Fun wfun 6530 ‘cfv 6536 Slot cslot 17236 ndxcnx 17248 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-res 5673 df-iota 6492 df-fun 6538 df-fv 6544 df-slot 17237 |
| This theorem is referenced by: strfv2 17257 opelstrbas 17277 ebtwntg 29332 ecgrtg 29333 elntg 29334 edgfiedgval 29367 |
| Copyright terms: Public domain | W3C validator |