Theorem fnrnov 7591

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 6941	. 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)})
2		fveq2 6882	. . . . . 6 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝐹‘⟨𝑥, 𝑦⟩))
3		df-ov 7420	. . . . . 6 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
4	2, 3	eqtr4di 2815	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝑥𝐹𝑦))
5	4	eqeq2d 2773	. . . 4 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑧 = (𝐹‘𝑤) ↔ 𝑧 = (𝑥𝐹𝑦)))
6	5	rexxp 5826	. . 3 ⊢ (∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦))
7	6	abbii 2829	. 2 ⊢ {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}
8	1, 7	eqtrdi 2813	1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2740  ∃wrex 3088  ⟨cop 4593   × cxp 5657  ran crn 5660   Fn wfn 6532  ‘cfv 6537  (class class class)co 7417

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-iota 6493  df-fun 6539  df-fn 6540  df-fv 6545  df-ov 7420

This theorem is used by:  ovelrn  7594