Theorem fv3 6903

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.

Step	Hyp	Ref	Expression
1		elfv 6883	. . 3 ⊢ (𝑥 ∈ (𝐹‘𝐴) ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
2		biimpr 223	. . . . . . . . . 10 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑦 = 𝑧 → 𝐴𝐹𝑦))
3	2	alimi 1843	. . . . . . . . 9 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦))
4		breq2 5106	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (𝐴𝐹𝑦 ↔ 𝐴𝐹𝑧))
5	4	equsalvw 2036	. . . . . . . . 9 ⊢ (∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦) ↔ 𝐴𝐹𝑧)
6	3, 5	sylib 221	. . . . . . . 8 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → 𝐴𝐹𝑧)
7	6	anim2i 629	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
8	7	eximi 1867	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
9		elequ2 2159	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦))
10		breq2 5106	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝐴𝐹𝑧 ↔ 𝐴𝐹𝑦))
11	9, 10	anbi12d 644	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦)))
12	11	cbvexvw 2069	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
13	8, 12	sylib 221	. . . . 5 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
14		exsimpr 1901	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
15		eu6 2599	. . . . . 6 ⊢ (∃!𝑦 𝐴𝐹𝑦 ↔ ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
16	14, 15	sylibr 237	. . . . 5 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃!𝑦 𝐴𝐹𝑦)
17	13, 16	jca 521	. . . 4 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
18		nfeu1 2614	. . . . . . 7 ⊢ Ⅎ𝑦∃!𝑦 𝐴𝐹𝑦
19		nfv 1946	. . . . . . . . 9 ⊢ Ⅎ𝑦 𝑥 ∈ 𝑧
20		nfa1 2187	. . . . . . . . 9 ⊢ Ⅎ𝑦∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)
21	19, 20	nfan 1931	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
22	21	nfex 2354	. . . . . . 7 ⊢ Ⅎ𝑦∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
23	18, 22	nfim 1928	. . . . . 6 ⊢ Ⅎ𝑦(∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
24		biimp 218	. . . . . . . . . . . . 13 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → 𝑦 = 𝑧))
25		ax9 2158	. . . . . . . . . . . . 13 ⊢ (𝑦 = 𝑧 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
26	24, 25	syl6 36	. . . . . . . . . . . 12 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
27	26	impcomd 417	. . . . . . . . . . 11 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
28	27	sps 2221	. . . . . . . . . 10 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
29	28	anc2ri 566	. . . . . . . . 9 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
30	29	com12 33	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
31	30	eximdv 1949	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
32	15, 31	biimtrid 245	. . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
33	23, 32	exlimi 2253	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
34	33	imp 412	. . . 4 ⊢ ((∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
35	17, 34	impbii 212	. . 3 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
36	1, 35	bitri 278	. 2 ⊢ (𝑥 ∈ (𝐹‘𝐴) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
37	36	eqabi 2895	1 ⊢ (𝐹‘𝐴) = {𝑥 ∣ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦)}

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃!weu 2593  {cab 2738   class class class wbr 5102  ‘cfv 6538

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-iota 6494  df-fv 6546

This theorem is used by:  brpermmodel  46086