Theorem fnrnov 6807

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 6242	. 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)})
2		fveq2 6191	. . . . . 6 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝐹‘⟨𝑥, 𝑦⟩))
3		df-ov 6653	. . . . . 6 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
4	2, 3	syl6eqr 2674	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝑥𝐹𝑦))
5	4	eqeq2d 2632	. . . 4 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑧 = (𝐹‘𝑤) ↔ 𝑧 = (𝑥𝐹𝑦)))
6	5	rexxp 5264	. . 3 ⊢ (∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦))
7	6	abbii 2739	. 2 ⊢ {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}
8	1, 7	syl6eq 2672	1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})

Syntax hints:   → wi 4   = wceq 1483  {cab 2608  ∃wrex 2913  ⟨cop 4183   × cxp 5112  ran crn 5115   Fn wfn 5883  ‘cfv 5888  (class class class)co 6650

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pr 4906

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896  df-ov 6653

This theorem is referenced by:  ovelrn  6810