| 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 17129. (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 17112 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
| 4 | cnvcnv2 6151 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
| 5 | 4 | fveq1i 6835 | . . . 4 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
| 6 | fvex 6847 | . . . . 5 ⊢ (𝐸‘ndx) ∈ V | |
| 7 | fvres 6853 | . . . . 5 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
| 9 | 5, 8 | eqtri 2759 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
| 10 | strfv2d.f | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) | |
| 11 | strfv2d.n | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
| 12 | strfv2d.c | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 13 | 12 | elexd 3464 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ V) |
| 14 | opelxpi 5661 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ V ∧ 𝐶 ∈ V) → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) | |
| 15 | 6, 13, 14 | sylancr 587 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
| 16 | 11, 15 | elind 4152 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
| 17 | cnvcnv 6150 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
| 18 | 16, 17 | eleqtrrdi 2847 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
| 19 | funopfv 6883 | . . . 4 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
| 20 | 10, 18, 19 | sylc 65 | . . 3 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
| 21 | 9, 20 | eqtr3id 2785 | . 2 ⊢ (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶) |
| 22 | 3, 21 | eqtr2d 2772 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 Vcvv 3440 ∩ cin 3900 〈cop 4586 × cxp 5622 ◡ccnv 5623 ↾ cres 5626 Fun wfun 6486 ‘cfv 6492 Slot cslot 17108 ndxcnx 17120 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-res 5636 df-iota 6448 df-fun 6494 df-fv 6500 df-slot 17109 |
| This theorem is referenced by: strfv2 17129 opelstrbas 17149 ebtwntg 29055 ecgrtg 29056 elntg 29057 edgfiedgval 29090 |
| Copyright terms: Public domain | W3C validator |