Theorem funfv2f 7000

Description: The value of a function. Version of funfv2 6999 using a bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 19-Feb-2006.)

Hypotheses

Ref	Expression
funfv2f.1	⊢ Ⅎ𝑦𝐴
funfv2f.2	⊢ Ⅎ𝑦𝐹

Assertion

Ref	Expression
funfv2f	⊢ (Fun 𝐹 → (𝐹‘𝐴) = ∪ {𝑦 ∣ 𝐴𝐹𝑦})

Proof of Theorem funfv2f

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		funfv2 6999	. 2 ⊢ (Fun 𝐹 → (𝐹‘𝐴) = ∪ {𝑤 ∣ 𝐴𝐹𝑤})
2		funfv2f.1	. . . . 5 ⊢ Ⅎ𝑦𝐴
3		funfv2f.2	. . . . 5 ⊢ Ⅎ𝑦𝐹
4		nfcv 2926	. . . . 5 ⊢ Ⅎ𝑦𝑤
5	2, 3, 4	nfbr 5156	. . . 4 ⊢ Ⅎ𝑦 𝐴𝐹𝑤
6		nfv 1949	. . . 4 ⊢ Ⅎ𝑤 𝐴𝐹𝑦
7		breq2 5110	. . . 4 ⊢ (𝑤 = 𝑦 → (𝐴𝐹𝑤 ↔ 𝐴𝐹𝑦))
8	5, 6, 7	cbvabw 2835	. . 3 ⊢ {𝑤 ∣ 𝐴𝐹𝑤} = {𝑦 ∣ 𝐴𝐹𝑦}
9	8	unieqi 4882	. 2 ⊢ ∪ {𝑤 ∣ 𝐴𝐹𝑤} = ∪ {𝑦 ∣ 𝐴𝐹𝑦}
10	1, 9	eqtrdi 2814	1 ⊢ (Fun 𝐹 → (𝐹‘𝐴) = ∪ {𝑦 ∣ 𝐴𝐹𝑦})

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2741  Ⅎwnfc 2911  ∪ cuni 4870   class class class wbr 5106  Fun wfun 6555  ‘cfv 6561

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pr 5396

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  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-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-fv 6569

This theorem is used by: (None)