Theorem tz6.12f 6921

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 4844	. . . . 5 ⊢ (𝑧 = 𝑦 → ⟨𝐴, 𝑧⟩ = ⟨𝐴, 𝑦⟩)
2	1	eleq1d 2849	. . . 4 ⊢ (𝑧 = 𝑦 → (⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
3		tz6.12f.1	. . . . . . 7 ⊢ Ⅎ𝑦𝐹
4	3	nfel2 2944	. . . . . 6 ⊢ Ⅎ𝑦⟨𝐴, 𝑧⟩ ∈ 𝐹
5		nfv 1948	. . . . . 6 ⊢ Ⅎ𝑧⟨𝐴, 𝑦⟩ ∈ 𝐹
6	4, 5, 2	cbveuw 2634	. . . . 5 ⊢ (∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹)
7	6	a1i 11	. . . 4 ⊢ (𝑧 = 𝑦 → (∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹))
8	2, 7	anbi12d 644	. . 3 ⊢ (𝑧 = 𝑦 → ((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) ↔ (⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹)))
9		eqeq2 2775	. . 3 ⊢ (𝑧 = 𝑦 → ((𝐹‘𝐴) = 𝑧 ↔ (𝐹‘𝐴) = 𝑦))
10	8, 9	imbi12d 347	. 2 ⊢ (𝑧 = 𝑦 → (((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑧) ↔ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)))
11		tz6.12 6920	. 2 ⊢ ((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑧)
12	10, 11	chvarvv 2023	1 ⊢ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∃!weu 2596  Ⅎwnfc 2911  ⟨cop 4838  ‘cfv 6547

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735

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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6501  df-fv 6555

This theorem is used by: (None)