Theorem fnrnov 7586

Description: The range of an operation expressed as a collection of the operation's values. (Contributed by NM, 29-Oct-2006.)

Assertion

Ref	Expression
fnrnov	⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})

Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐹,𝑦,𝑧

Proof of Theorem fnrnov

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fnrnfv 6936	. 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)})
2		fveq2 6877	. . . . . 6 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝐹‘⟨𝑥, 𝑦⟩))
3		df-ov 7415	. . . . . 6 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
4	2, 3	eqtr4di 2814	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝑥𝐹𝑦))
5	4	eqeq2d 2772	. . . 4 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑧 = (𝐹‘𝑤) ↔ 𝑧 = (𝑥𝐹𝑦)))
6	5	rexxp 5819	. . 3 ⊢ (∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦))
7	6	abbii 2828	. 2 ⊢ {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}
8	1, 7	eqtrdi 2812	1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2739  ∃wrex 3087  ⟨cop 4590   × cxp 5649  ran crn 5652   Fn wfn 6526  ‘cfv 6531  (class class class)co 7412

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-ov 7415

This theorem is used by:  ovelrn  7589