Theorem fv3 6206

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 6189	. . 3 ⊢ (𝑥 ∈ (𝐹‘𝐴) ↔ ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
2		biimpr 210	. . . . . . . . . 10 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑦 = 𝑧 → 𝐴𝐹𝑦))
3	2	alimi 1739	. . . . . . . . 9 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦))
4		vex 3203	. . . . . . . . . 10 ⊢ 𝑧 ∈ V
5		breq2 4657	. . . . . . . . . 10 ⊢ (𝑦 = 𝑧 → (𝐴𝐹𝑦 ↔ 𝐴𝐹𝑧))
6	4, 5	ceqsalv 3233	. . . . . . . . 9 ⊢ (∀𝑦(𝑦 = 𝑧 → 𝐴𝐹𝑦) ↔ 𝐴𝐹𝑧)
7	3, 6	sylib 208	. . . . . . . 8 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → 𝐴𝐹𝑧)
8	7	anim2i 593	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
9	8	eximi 1762	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧))
10		elequ2 2004	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝑥 ∈ 𝑧 ↔ 𝑥 ∈ 𝑦))
11		breq2 4657	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (𝐴𝐹𝑧 ↔ 𝐴𝐹𝑦))
12	10, 11	anbi12d 747	. . . . . . 7 ⊢ (𝑧 = 𝑦 → ((𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ (𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦)))
13	12	cbvexv 2275	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ 𝐴𝐹𝑧) ↔ ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
14	9, 13	sylib 208	. . . . 5 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦))
15		exsimpr 1796	. . . . . 6 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
16		df-eu 2474	. . . . . 6 ⊢ (∃!𝑦 𝐴𝐹𝑦 ↔ ∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
17	15, 16	sylibr 224	. . . . 5 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → ∃!𝑦 𝐴𝐹𝑦)
18	14, 17	jca 554	. . . 4 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) → (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
19		nfeu1 2480	. . . . . . 7 ⊢ Ⅎ𝑦∃!𝑦 𝐴𝐹𝑦
20		nfv 1843	. . . . . . . . 9 ⊢ Ⅎ𝑦 𝑥 ∈ 𝑧
21		nfa1 2028	. . . . . . . . 9 ⊢ Ⅎ𝑦∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)
22	20, 21	nfan 1828	. . . . . . . 8 ⊢ Ⅎ𝑦(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
23	22	nfex 2154	. . . . . . 7 ⊢ Ⅎ𝑦∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))
24	19, 23	nfim 1825	. . . . . 6 ⊢ Ⅎ𝑦(∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
25		biimp 205	. . . . . . . . . . . . . 14 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → 𝑦 = 𝑧))
26		ax9 2003	. . . . . . . . . . . . . 14 ⊢ (𝑦 = 𝑧 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧))
27	25, 26	syl6 35	. . . . . . . . . . . . 13 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝐴𝐹𝑦 → (𝑥 ∈ 𝑦 → 𝑥 ∈ 𝑧)))
28	27	com23 86	. . . . . . . . . . . 12 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑥 ∈ 𝑦 → (𝐴𝐹𝑦 → 𝑥 ∈ 𝑧)))
29	28	impd 447	. . . . . . . . . . 11 ⊢ ((𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
30	29	sps 2055	. . . . . . . . . 10 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → 𝑥 ∈ 𝑧))
31	30	anc2ri 581	. . . . . . . . 9 ⊢ (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
32	31	com12 32	. . . . . . . 8 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → (𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
33	32	eximdv 1846	. . . . . . 7 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃𝑧∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
34	16, 33	syl5bi 232	. . . . . 6 ⊢ ((𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
35	24, 34	exlimi 2086	. . . . 5 ⊢ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) → (∃!𝑦 𝐴𝐹𝑦 → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧))))
36	35	imp 445	. . . 4 ⊢ ((∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦) → ∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)))
37	18, 36	impbii 199	. . 3 ⊢ (∃𝑧(𝑥 ∈ 𝑧 ∧ ∀𝑦(𝐴𝐹𝑦 ↔ 𝑦 = 𝑧)) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
38	1, 37	bitri 264	. 2 ⊢ (𝑥 ∈ (𝐹‘𝐴) ↔ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦))
39	38	abbi2i 2738	1 ⊢ (𝐹‘𝐴) = {𝑥 ∣ (∃𝑦(𝑥 ∈ 𝑦 ∧ 𝐴𝐹𝑦) ∧ ∃!𝑦 𝐴𝐹𝑦)}

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384  ∀wal 1481   = wceq 1483  ∃wex 1704   ∈ wcel 1990  ∃!weu 2470  {cab 2608   class class class wbr 4653  ‘cfv 5888

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-rex 2918  df-rab 2921  df-v 3202  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-iota 5851  df-fv 5896

This theorem is referenced by: (None)