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

Theorem fv3 6895
Description: Alternate definition of the value of a function. Definition 6.11 of [TakeutiZaring] p. 26. (Contributed by NM, 30-Apr-2004.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
fv3 (𝐹‘𝐴) = {𝑥 ∣ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦)}
Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝐴,𝑦

Proof of Theorem fv3
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 elfv 6875 . . 3 (𝑥 ∈ (𝐹‘𝐴) ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
2 biimpr 223 . . . . . . . . . 10 ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑦 = 𝑧 → 𝐴𝐹𝑦))
32alimi 1844 . . . . . . . . 9 (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦))
4 breq2 5107 . . . . . . . . . 10 (𝑦 = 𝑧 → (𝐴𝐹𝑦 ↔ 𝐴𝐹𝑧))
54equsalvw 2037 . . . . . . . . 9 (∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦) ↔ 𝐴𝐹𝑧)
63, 5sylib 221 . . . . . . . 8 (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → 𝐴𝐹𝑧)
76anim2i 629 . . . . . . 7 ((𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
87eximi 1868 . . . . . 6 (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
9 elequ2 2160 . . . . . . . 8 (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦))
10 breq2 5107 . . . . . . . 8 (𝑧 = 𝑦 → (𝐴𝐹𝑧 ↔ 𝐴𝐹𝑦))
119, 10anbi12d 644 . . . . . . 7 (𝑧 = 𝑦 → ((𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦)))
1211cbvexvw 2070 . . . . . 6 (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
138, 12sylib 221 . . . . 5 (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
14 exsimpr 1902 . . . . . 6 (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
15 eu6 2600 . . . . . 6 (∃!𝑦 𝐴𝐹𝑦 ↔ ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
1614, 15sylibr 237 . . . . 5 (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃!𝑦 𝐴𝐹𝑦)
1713, 16jca 521 . . . 4 (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
18 nfeu1 2615 . . . . . . 7 Ⅎ𝑦∃!𝑦 𝐴𝐹𝑦
19 nfv 1947 . . . . . . . . 9 Ⅎ𝑦 𝑥 ∈ 𝑧
20 nfa1 2188 . . . . . . . . 9 Ⅎ𝑦∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)
2119, 20nfan 1932 . . . . . . . 8 Ⅎ𝑦(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
2221nfex 2355 . . . . . . 7 Ⅎ𝑦∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
2318, 22nfim 1929 . . . . . 6 Ⅎ𝑦(∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
24 biimp 218 . . . . . . . . . . . . 13 ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → 𝑦 = 𝑧))
25 ax9 2159 . . . . . . . . . . . . 13 (𝑦 = 𝑧 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
2624, 25syl6 36 . . . . . . . . . . . 12 ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
2726impcomd 417 . . . . . . . . . . 11 ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
2827sps 2222 . . . . . . . . . 10 (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
2928anc2ri 566 . . . . . . . . 9 (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
3029com12 33 . . . . . . . 8 ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
3130eximdv 1950 . . . . . . 7 ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
3215, 31biimtrid 245 . . . . . 6 ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
3323, 32exlimi 2254 . . . . 5 (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
3433imp 412 . . . 4 ((∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
3517, 34impbii 212 . . 3 (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
361, 35bitri 278 . 2 (𝑥 ∈ (𝐹‘𝐴) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
3736eqabi 2896 1 (𝐹‘𝐴) = {𝑥 ∣ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃!weu 2594  {cab 2739   class class class wbr 5103  ‘cfv 6531
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 2733
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  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-iota 6487  df-fv 6539
This theorem is used by:  brpermmodel  45945
  Copyright terms: Public domain W3C validator