Theorem tz6.12f 5202

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 3550	. . . . 5 ⊢ (𝑧 = 𝑦 → ⟨𝐴, 𝑧⟩ = ⟨𝐴, 𝑦⟩)
2	1	eleq1d 2106	. . . 4 ⊢ (𝑧 = 𝑦 → (⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ⟨𝐴, 𝑦⟩ ∈ 𝐹))
3		tz6.12f.1	. . . . . . 7 ⊢ Ⅎ𝑦𝐹
4	3	nfel2 2190	. . . . . 6 ⊢ Ⅎ𝑦⟨𝐴, 𝑧⟩ ∈ 𝐹
5		nfv 1421	. . . . . 6 ⊢ Ⅎ𝑧⟨𝐴, 𝑦⟩ ∈ 𝐹
6	4, 5, 2	cbveu 1924	. . . . 5 ⊢ (∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹)
7	6	a1i 9	. . . 4 ⊢ (𝑧 = 𝑦 → (∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹 ↔ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹))
8	2, 7	anbi12d 442	. . 3 ⊢ (𝑧 = 𝑦 → ((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) ↔ (⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹)))
9		eqeq2 2049	. . 3 ⊢ (𝑧 = 𝑦 → ((𝐹‘𝐴) = 𝑧 ↔ (𝐹‘𝐴) = 𝑦))
10	8, 9	imbi12d 223	. 2 ⊢ (𝑧 = 𝑦 → (((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑧) ↔ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)))
11		tz6.12 5201	. 2 ⊢ ((⟨𝐴, 𝑧⟩ ∈ 𝐹 ∧ ∃!𝑧⟨𝐴, 𝑧⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑧)
12	10, 11	chvarv 1812	1 ⊢ ((⟨𝐴, 𝑦⟩ ∈ 𝐹 ∧ ∃!𝑦⟨𝐴, 𝑦⟩ ∈ 𝐹) → (𝐹‘𝐴) = 𝑦)

Syntax hints:   → wi 4   ∧ wa 97   ↔ wb 98   = wceq 1243   ∈ wcel 1393  ∃!weu 1900  Ⅎwnfc 2165  ⟨cop 3378  ‘cfv 4902

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-rex 2312  df-v 2559  df-sbc 2765  df-un 2922  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-iota 4867  df-fv 4910

This theorem is referenced by: (None)