| 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 17294. (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 17277 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
| 4 | cnvcnv2 6186 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ↾ V) | |
| 5 | 4 | fveq1i 6879 | . . . 4 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = ((𝑆 ↾ V)‘(𝐸‘ndx)) |
| 6 | fvex 6891 | . . . . 5 ⊢ (𝐸‘ndx) ∈ V | |
| 7 | fvres 6897 | . . . . 5 ⊢ ((𝐸‘ndx) ∈ V → ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx))) | |
| 8 | 6, 7 | ax-mp 5 | . . . 4 ⊢ ((𝑆 ↾ V)‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
| 9 | 5, 8 | eqtri 2783 | . . 3 ⊢ (◡◡𝑆‘(𝐸‘ndx)) = (𝑆‘(𝐸‘ndx)) |
| 10 | strfv2d.f | . . . 4 ⊢ (𝜑 → Fun ◡◡𝑆) | |
| 11 | strfv2d.n | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
| 12 | strfv2d.c | . . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ 𝑊) | |
| 13 | 12 | elexd 3473 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ V) |
| 14 | opelxpi 5692 | . . . . . . 7 ⊢ (((𝐸‘ndx) ∈ V ∧ 𝐶 ∈ V) → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) | |
| 15 | 6, 13, 14 | sylancr 599 | . . . . . 6 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (V × V)) |
| 16 | 11, 15 | elind 4146 | . . . . 5 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ (𝑆 ∩ (V × V))) |
| 17 | cnvcnv 6185 | . . . . 5 ⊢ ◡◡𝑆 = (𝑆 ∩ (V × V)) | |
| 18 | 16, 17 | eleqtrrdi 2871 | . . . 4 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆) |
| 19 | funopfv 6927 | . . . 4 ⊢ (Fun ◡◡𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ ◡◡𝑆 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶)) | |
| 20 | 10, 18, 19 | sylc 66 | . . 3 ⊢ (𝜑 → (◡◡𝑆‘(𝐸‘ndx)) = 𝐶) |
| 21 | 9, 20 | eqtr3id 2809 | . 2 ⊢ (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶) |
| 22 | 3, 21 | eqtr2d 2796 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 Vcvv 3450 ∩ cin 3898 〈cop 4590 × cxp 5653 ◡ccnv 5654 ↾ cres 5657 Fun wfun 6527 ‘cfv 6533 Slot cslot 17273 ndxcnx 17285 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-res 5667 df-iota 6489 df-fun 6535 df-fv 6541 df-slot 17274 |
| This theorem is used by: strfv2 17294 opelstrbas 17314 ebtwntg 29439 ecgrtg 29440 elntg 29441 edgfiedgval 29474 |
| Copyright terms: Public domain | W3C validator |