Theorem fnrnov 5870

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 5422	. 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)})
2		fveq2 5375	. . . . . 6 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝐹‘⟨𝑥, 𝑦⟩))
3		df-ov 5731	. . . . . 6 ⊢ (𝑥𝐹𝑦) = (𝐹‘⟨𝑥, 𝑦⟩)
4	2, 3	syl6eqr 2165	. . . . 5 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝐹‘𝑤) = (𝑥𝐹𝑦))
5	4	eqeq2d 2126	. . . 4 ⊢ (𝑤 = ⟨𝑥, 𝑦⟩ → (𝑧 = (𝐹‘𝑤) ↔ 𝑧 = (𝑥𝐹𝑦)))
6	5	rexxp 4643	. . 3 ⊢ (∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦))
7	6	abbii 2230	. 2 ⊢ {𝑧 ∣ ∃𝑤 ∈ (𝐴 × 𝐵)𝑧 = (𝐹‘𝑤)} = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}
8	1, 7	syl6eq 2163	1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})

Syntax hints:   → wi 4   = wceq 1314  {cab 2101  ∃wrex 2391  ⟨cop 3496   × cxp 4497  ran crn 4500   Fn wfn 5076  ‘cfv 5081  (class class class)co 5728

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 681  ax-5 1406  ax-7 1407  ax-gen 1408  ax-ie1 1452  ax-ie2 1453  ax-8 1465  ax-10 1466  ax-11 1467  ax-i12 1468  ax-bndl 1469  ax-4 1470  ax-14 1475  ax-17 1489  ax-i9 1493  ax-ial 1497  ax-i5r 1498  ax-ext 2097  ax-sep 4006  ax-pow 4058  ax-pr 4091

This theorem depends on definitions:  df-bi 116  df-3an 947  df-tru 1317  df-nf 1420  df-sb 1719  df-eu 1978  df-mo 1979  df-clab 2102  df-cleq 2108  df-clel 2111  df-nfc 2244  df-ral 2395  df-rex 2396  df-v 2659  df-sbc 2879  df-csb 2972  df-un 3041  df-in 3043  df-ss 3050  df-pw 3478  df-sn 3499  df-pr 3500  df-op 3502  df-uni 3703  df-iun 3781  df-br 3896  df-opab 3950  df-mpt 3951  df-id 4175  df-xp 4505  df-rel 4506  df-cnv 4507  df-co 4508  df-dm 4509  df-rn 4510  df-iota 5046  df-fun 5083  df-fn 5084  df-fv 5089  df-ov 5731

This theorem is referenced by:  ovelrn  5873