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

Theorem fvmptt 6208
Description: Closed theorem form of fvmpt 6191. (Contributed by Scott Fenton, 21-Feb-2013.) (Revised by Mario Carneiro, 11-Sep-2015.)
Assertion
Ref Expression
fvmptt ((∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) ∧ 𝐹 = (𝑥𝐷𝐵) ∧ (𝐴𝐷𝐶𝑉)) → (𝐹𝐴) = 𝐶)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐶   𝑥,𝐷
Allowed substitution hints:   𝐵(𝑥)   𝐹(𝑥)   𝑉(𝑥)

Proof of Theorem fvmptt
StepHypRef Expression
1 simp2 1055 . . 3 ((∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) ∧ 𝐹 = (𝑥𝐷𝐵) ∧ (𝐴𝐷𝐶𝑉)) → 𝐹 = (𝑥𝐷𝐵))
21fveq1d 6105 . 2 ((∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) ∧ 𝐹 = (𝑥𝐷𝐵) ∧ (𝐴𝐷𝐶𝑉)) → (𝐹𝐴) = ((𝑥𝐷𝐵)‘𝐴))
3 risset 3044 . . . . 5 (𝐴𝐷 ↔ ∃𝑥𝐷 𝑥 = 𝐴)
4 elex 3185 . . . . . 6 (𝐶𝑉𝐶 ∈ V)
5 nfa1 2015 . . . . . . 7 𝑥𝑥(𝑥 = 𝐴𝐵 = 𝐶)
6 nfv 1830 . . . . . . . 8 𝑥 𝐶 ∈ V
7 nffvmpt1 6111 . . . . . . . . 9 𝑥((𝑥𝐷𝐵)‘𝐴)
87nfeq1 2764 . . . . . . . 8 𝑥((𝑥𝐷𝐵)‘𝐴) = 𝐶
96, 8nfim 1813 . . . . . . 7 𝑥(𝐶 ∈ V → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)
10 simprl 790 . . . . . . . . . . . . 13 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → 𝑥𝐷)
11 simplr 788 . . . . . . . . . . . . . 14 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → 𝐵 = 𝐶)
12 simprr 792 . . . . . . . . . . . . . 14 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → 𝐶 ∈ V)
1311, 12eqeltrd 2688 . . . . . . . . . . . . 13 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → 𝐵 ∈ V)
14 eqid 2610 . . . . . . . . . . . . . 14 (𝑥𝐷𝐵) = (𝑥𝐷𝐵)
1514fvmpt2 6200 . . . . . . . . . . . . 13 ((𝑥𝐷𝐵 ∈ V) → ((𝑥𝐷𝐵)‘𝑥) = 𝐵)
1610, 13, 15syl2anc 691 . . . . . . . . . . . 12 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → ((𝑥𝐷𝐵)‘𝑥) = 𝐵)
17 simpll 786 . . . . . . . . . . . . 13 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → 𝑥 = 𝐴)
1817fveq2d 6107 . . . . . . . . . . . 12 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → ((𝑥𝐷𝐵)‘𝑥) = ((𝑥𝐷𝐵)‘𝐴))
1916, 18, 113eqtr3d 2652 . . . . . . . . . . 11 (((𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝑥𝐷𝐶 ∈ V)) → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)
2019exp43 638 . . . . . . . . . 10 (𝑥 = 𝐴 → (𝐵 = 𝐶 → (𝑥𝐷 → (𝐶 ∈ V → ((𝑥𝐷𝐵)‘𝐴) = 𝐶))))
2120a2i 14 . . . . . . . . 9 ((𝑥 = 𝐴𝐵 = 𝐶) → (𝑥 = 𝐴 → (𝑥𝐷 → (𝐶 ∈ V → ((𝑥𝐷𝐵)‘𝐴) = 𝐶))))
2221com23 84 . . . . . . . 8 ((𝑥 = 𝐴𝐵 = 𝐶) → (𝑥𝐷 → (𝑥 = 𝐴 → (𝐶 ∈ V → ((𝑥𝐷𝐵)‘𝐴) = 𝐶))))
2322sps 2043 . . . . . . 7 (∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) → (𝑥𝐷 → (𝑥 = 𝐴 → (𝐶 ∈ V → ((𝑥𝐷𝐵)‘𝐴) = 𝐶))))
245, 9, 23rexlimd 3008 . . . . . 6 (∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) → (∃𝑥𝐷 𝑥 = 𝐴 → (𝐶 ∈ V → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)))
254, 24syl7 72 . . . . 5 (∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) → (∃𝑥𝐷 𝑥 = 𝐴 → (𝐶𝑉 → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)))
263, 25syl5bi 231 . . . 4 (∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) → (𝐴𝐷 → (𝐶𝑉 → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)))
2726imp32 448 . . 3 ((∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) ∧ (𝐴𝐷𝐶𝑉)) → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)
28273adant2 1073 . 2 ((∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) ∧ 𝐹 = (𝑥𝐷𝐵) ∧ (𝐴𝐷𝐶𝑉)) → ((𝑥𝐷𝐵)‘𝐴) = 𝐶)
292, 28eqtrd 2644 1 ((∀𝑥(𝑥 = 𝐴𝐵 = 𝐶) ∧ 𝐹 = (𝑥𝐷𝐵) ∧ (𝐴𝐷𝐶𝑉)) → (𝐹𝐴) = 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1031  wal 1473   = wceq 1475  wcel 1977  wrex 2897  Vcvv 3173  cmpt 4643  cfv 5804
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fv 5812
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator