Theorem fv3 6116

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 6101	. . 3 ⊢ (𝑥 ∈ (𝐹‘𝐴) ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
2		biimpr 209	. . . . . . . . . 10 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑦 = 𝑧 → 𝐴𝐹𝑦))
3	2	alimi 1730	. . . . . . . . 9 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦))
4		vex 3176	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
5		breq2 4587	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (𝐴𝐹𝑦 ↔ 𝐴𝐹𝑧))
6	4, 5	ceqsalv 3206	. . . . . . . . 9 ⊢ (∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦) ↔ 𝐴𝐹𝑧)
7	3, 6	sylib 207	. . . . . . . 8 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → 𝐴𝐹𝑧)
8	7	anim2i 591	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
9	8	eximi 1752	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
10		elequ2 1991	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦))
11		breq2 4587	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝐴𝐹𝑧 ↔ 𝐴𝐹𝑦))
12	10, 11	anbi12d 743	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦)))
13	12	cbvexv 2263	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
14	9, 13	sylib 207	. . . . 5 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
15		exsimpr 1784	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
16		df-eu 2462	. . . . . 6 ⊢ (∃!𝑦 𝐴𝐹𝑦 ↔ ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
17	15, 16	sylibr 223	. . . . 5 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃!𝑦 𝐴𝐹𝑦)
18	14, 17	jca 553	. . . 4 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
19		nfeu1 2468	. . . . . . 7 ⊢ Ⅎ𝑦∃!𝑦 𝐴𝐹𝑦
20		nfv 1830	. . . . . . . . 9 ⊢ Ⅎ𝑦 𝑥 ∈ 𝑧
21		nfa1 2015	. . . . . . . . 9 ⊢ Ⅎ𝑦∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)
22	20, 21	nfan 1816	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
23	22	nfex 2140	. . . . . . 7 ⊢ Ⅎ𝑦∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
24	19, 23	nfim 1813	. . . . . 6 ⊢ Ⅎ𝑦(∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
25		biimp 204	. . . . . . . . . . . . . 14 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → 𝑦 = 𝑧))
26		ax9 1990	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑧 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
27	25, 26	syl6 34	. . . . . . . . . . . . 13 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
28	27	com23 84	. . . . . . . . . . . 12 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑥 ∈ 𝑦 → (𝐴𝐹𝑦 → 𝑥 ∈ 𝑧)))
29	28	impd 446	. . . . . . . . . . 11 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
30	29	sps 2043	. . . . . . . . . 10 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
31	30	anc2ri 579	. . . . . . . . 9 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
32	31	com12 32	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
33	32	eximdv 1833	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
34	16, 33	syl5bi 231	. . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
35	24, 34	exlimi 2073	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
36	35	imp 444	. . . 4 ⊢ ((∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
37	18, 36	impbii 198	. . 3 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
38	1, 37	bitri 263	. 2 ⊢ (𝑥 ∈ (𝐹‘𝐴) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
39	38	abbi2i 2725	1 ⊢ (𝐹‘𝐴) = {𝑥 ∣ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦)}

Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383  ∀wal 1473   = wceq 1475  ∃wex 1695   ∈ wcel 1977  ∃!weu 2458  {cab 2596   class class class wbr 4583  ‘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-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

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-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rex 2902  df-rab 2905  df-v 3175  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-iota 5768  df-fv 5812

This theorem is referenced by: (None)