Theorem fnrnov 7436

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 6823	. 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)})
2		fveq2 6768	. . . . . 6 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝐹‘⟨𝑥, 𝑦⟩))
3		df-ov 7271	. . . . . 6 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
4	2, 3	eqtr4di 2797	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝑥𝐹𝑦))
5	4	eqeq2d 2750	. . . 4 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑧 = (𝐹‘𝑤) ↔ 𝑧 = (𝑥𝐹𝑦)))
6	5	rexxp 5748	. . 3 ⊢ (∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦))
7	6	abbii 2809	. 2 ⊢ {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}
8	1, 7	eqtrdi 2795	1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})

Syntax hints:   → wi 4   = wceq 1541  {cab 2716  ∃wrex 3066  ⟨cop 4572   × cxp 5586  ran crn 5589   Fn wfn 6425  ‘cfv 6430  (class class class)co 7268

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1801  ax-4 1815  ax-5 1916  ax-6 1974  ax-7 2014  ax-8 2111  ax-9 2119  ax-10 2140  ax-11 2157  ax-12 2174  ax-ext 2710  ax-sep 5226  ax-nul 5233  ax-pr 5355

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1544  df-fal 1554  df-ex 1786  df-nf 1790  df-sb 2071  df-mo 2541  df-eu 2570  df-clab 2717  df-cleq 2731  df-clel 2817  df-nfc 2890  df-ral 3070  df-rex 3071  df-rab 3074  df-v 3432  df-sbc 3720  df-csb 3837  df-dif 3894  df-un 3896  df-in 3898  df-ss 3908  df-nul 4262  df-if 4465  df-sn 4567  df-pr 4569  df-op 4573  df-uni 4845  df-iun 4931  df-br 5079  df-opab 5141  df-mpt 5162  df-id 5488  df-xp 5594  df-rel 5595  df-cnv 5596  df-co 5597  df-dm 5598  df-rn 5599  df-iota 6388  df-fun 6432  df-fn 6433  df-fv 6438  df-ov 7271

This theorem is referenced by:  ovelrn  7439