Theorem tz6.12f 6250

Description: Function value, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 30-Aug-1999.)

Hypothesis

Ref	Expression
tz6.12f.1	⊢ Ⅎ𝑦𝐹

Assertion

Ref	Expression
tz6.12f	⊢ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)

Distinct variable group:   𝑦,𝐴

Allowed substitution hint:   𝐹(𝑦)

Proof of Theorem tz6.12f

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		opeq2 4434	. . . . 5 ⊢ (𝑧 = 𝑦 → ⟨𝐴, 𝑧⟩ = ⟨𝐴, 𝑦⟩)
2	1	eleq1d 2715	. . . 4 ⊢ (𝑧 = 𝑦 → (⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
3		tz6.12f.1	. . . . . . 7 ⊢ Ⅎ𝑦𝐹
4	3	nfel2 2810	. . . . . 6 ⊢ Ⅎ𝑦⟨𝐴, 𝑧⟩ ∈ 𝐹
5		nfv 1883	. . . . . 6 ⊢ Ⅎ𝑧⟨𝐴, 𝑦⟩ ∈ 𝐹
6	4, 5, 2	cbveu 2534	. . . . 5 ⊢ (∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹)
7	6	a1i 11	. . . 4 ⊢ (𝑧 = 𝑦 → (∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹))
8	2, 7	anbi12d 747	. . 3 ⊢ (𝑧 = 𝑦 → ((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) ↔ (⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹)))
9		eqeq2 2662	. . 3 ⊢ (𝑧 = 𝑦 → ((𝐹‘𝐴) = 𝑧 ↔ (𝐹‘𝐴) = 𝑦))
10	8, 9	imbi12d 333	. 2 ⊢ (𝑧 = 𝑦 → (((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑧) ↔ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)))
11		tz6.12 6249	. 2 ⊢ ((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑧)
12	10, 11	chvarv 2299	1 ⊢ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1523   ∈ wcel 2030  ∃!weu 2498  Ⅎwnfc 2780  ⟨cop 4216  ‘cfv 5926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-rex 2947  df-rab 2950  df-v 3233  df-sbc 3469  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-iota 5889  df-fv 5934

This theorem is referenced by: (None)