MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  strfvd Structured version   Visualization version   GIF version

Theorem strfvd 17238
Description: Deduction version of strfv 17241. (Contributed by Mario Carneiro, 15-Nov-2014.)
Hypotheses
Ref Expression
strfvd.e 𝐸 = Slot (𝐸‘ndx)
strfvd.s (𝜑𝑆𝑉)
strfvd.f (𝜑 → Fun 𝑆)
strfvd.n (𝜑 → ⟨(𝐸‘ndx), 𝐶⟩ ∈ 𝑆)
Assertion
Ref Expression
strfvd (𝜑𝐶 = (𝐸𝑆))

Proof of Theorem strfvd
StepHypRef Expression
1 strfvd.e . . 3 𝐸 = Slot (𝐸‘ndx)
2 strfvd.s . . 3 (𝜑𝑆𝑉)
31, 2strfvnd 17223 . 2 (𝜑 → (𝐸𝑆) = (𝑆‘(𝐸‘ndx)))
4 strfvd.f . . 3 (𝜑 → Fun 𝑆)
5 strfvd.n . . 3 (𝜑 → ⟨(𝐸‘ndx), 𝐶⟩ ∈ 𝑆)
6 funopfv 6957 . . 3 (Fun 𝑆 → (⟨(𝐸‘ndx), 𝐶⟩ ∈ 𝑆 → (𝑆‘(𝐸‘ndx)) = 𝐶))
74, 5, 6sylc 65 . 2 (𝜑 → (𝑆‘(𝐸‘ndx)) = 𝐶)
83, 7eqtr2d 2777 1 (𝜑𝐶 = (𝐸𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2107  cop 4631  Fun wfun 6554  cfv 6560  Slot cslot 17219  ndxcnx 17231
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-sep 5295  ax-nul 5305  ax-pr 5431
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rab 3436  df-v 3481  df-dif 3953  df-un 3955  df-ss 3967  df-nul 4333  df-if 4525  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-br 5143  df-opab 5205  df-mpt 5225  df-id 5577  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-iota 6513  df-fun 6562  df-fv 6568  df-slot 17220
This theorem is referenced by:  strssd  17243
  Copyright terms: Public domain W3C validator