Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  ovelrn GIF version

Theorem ovelrn 5649
 Description: A member of an operation's range is a value of the operation. (Contributed by NM, 7-Feb-2007.) (Revised by Mario Carneiro, 30-Jan-2014.)
Assertion
Ref Expression
ovelrn (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐹,𝑦

Proof of Theorem ovelrn
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 fnrnov 5646 . . 3 (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)})
21eleq2d 2107 . 2 (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹𝐶 ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)}))
3 elex 2566 . . . 4 (𝐶 ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)} → 𝐶 ∈ V)
43a1i 9 . . 3 (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)} → 𝐶 ∈ V))
5 fnovex 5538 . . . . . 6 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥𝐴𝑦𝐵) → (𝑥𝐹𝑦) ∈ V)
6 eleq1 2100 . . . . . 6 (𝐶 = (𝑥𝐹𝑦) → (𝐶 ∈ V ↔ (𝑥𝐹𝑦) ∈ V))
75, 6syl5ibrcom 146 . . . . 5 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥𝐴𝑦𝐵) → (𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V))
873expb 1105 . . . 4 ((𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥𝐴𝑦𝐵)) → (𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V))
98rexlimdvva 2440 . . 3 (𝐹 Fn (𝐴 × 𝐵) → (∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V))
10 eqeq1 2046 . . . . . 6 (𝑧 = 𝐶 → (𝑧 = (𝑥𝐹𝑦) ↔ 𝐶 = (𝑥𝐹𝑦)))
11102rexbidv 2349 . . . . 5 (𝑧 = 𝐶 → (∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦) ↔ ∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦)))
1211elabg 2688 . . . 4 (𝐶 ∈ V → (𝐶 ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦)))
1312a1i 9 . . 3 (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ V → (𝐶 ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦))))
144, 9, 13pm5.21ndd 621 . 2 (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ {𝑧 ∣ ∃𝑥𝐴𝑦𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦)))
152, 14bitrd 177 1 (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥𝐴𝑦𝐵 𝐶 = (𝑥𝐹𝑦)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ↔ wb 98   ∧ w3a 885   = wceq 1243   ∈ wcel 1393  {cab 2026  ∃wrex 2307  Vcvv 2557   × cxp 4343  ran crn 4346   Fn wfn 4897  (class class class)co 5512 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944 This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-sbc 2765  df-csb 2853  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-iota 4867  df-fun 4904  df-fn 4905  df-fv 4910  df-ov 5515 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator