| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > strfvd | Structured version Visualization version GIF version | ||
| Description: Deduction version of strfv 17227. (Contributed by Mario Carneiro, 15-Nov-2014.) |
| Ref | Expression |
|---|---|
| strfvd.e | ⊢ 𝐸 = Slot (𝐸‘ndx) |
| strfvd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
| strfvd.f | ⊢ (𝜑 → Fun 𝑆) |
| strfvd.n | ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) |
| Ref | Expression |
|---|---|
| strfvd | ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | strfvd.e | . . 3 ⊢ 𝐸 = Slot (𝐸‘ndx) | |
| 2 | strfvd.s | . . 3 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
| 3 | 1, 2 | strfvnd 17209 | . 2 ⊢ (𝜑 → (𝐸‘𝑆) = (𝑆‘(𝐸‘ndx))) |
| 4 | strfvd.f | . . 3 ⊢ (𝜑 → Fun 𝑆) | |
| 5 | strfvd.n | . . 3 ⊢ (𝜑 → 〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆) | |
| 6 | funopfv 6933 | . . 3 ⊢ (Fun 𝑆 → (〈(𝐸‘ndx), 𝐶〉 ∈ 𝑆 → (𝑆‘(𝐸‘ndx)) = 𝐶)) | |
| 7 | 4, 5, 6 | sylc 65 | . 2 ⊢ (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶) |
| 8 | 3, 7 | eqtr2d 2772 | 1 ⊢ (𝜑 → 𝐶 = (𝐸‘𝑆)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2109 〈cop 4612 Fun wfun 6530 ‘cfv 6536 Slot cslot 17205 ndxcnx 17217 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pr 5407 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-iota 6489 df-fun 6538 df-fv 6544 df-slot 17206 |
| This theorem is referenced by: strssd 17229 |
| Copyright terms: Public domain | W3C validator |