| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ovelrn | GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| ovelrn | ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnrnov 6228 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}) | |
| 2 | 1 | eleq2d 2308 | . 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ 𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})) |
| 3 | elex 2833 | . . . 4 ⊢ (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} → 𝐶 ∈ V) | |
| 4 | 3 | a1i 9 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} → 𝐶 ∈ V)) |
| 5 | fnovex 6111 | . . . . . 6 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝐹𝑦) ∈ V) | |
| 6 | eleq1 2301 | . . . . . 6 ⊢ (𝐶 = (𝑥𝐹𝑦) → (𝐶 ∈ V ↔ (𝑥𝐹𝑦) ∈ V)) | |
| 7 | 5, 6 | syl5ibrcom 157 | . . . . 5 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V)) |
| 8 | 7 | 3expb 1235 | . . . 4 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V)) |
| 9 | 8 | rexlimdvva 2676 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V)) |
| 10 | eqeq1 2245 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑧 = (𝑥𝐹𝑦) ↔ 𝐶 = (𝑥𝐹𝑦))) | |
| 11 | 10 | 2rexbidv 2575 | . . . . 5 ⊢ (𝑧 = 𝐶 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
| 12 | 11 | elabg 2972 | . . . 4 ⊢ (𝐶 ∈ V → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
| 13 | 12 | a1i 9 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ V → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦)))) |
| 14 | 4, 9, 13 | pm5.21ndd 717 | . 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
| 15 | 2, 14 | bitrd 188 | 1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 {cab 2224 ∃wrex 2529 Vcvv 2821 × cxp 4770 ran crn 4773 Fn wfn 5370 (class class class)co 6078 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4247 ax-pow 4309 ax-pr 4344 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-csb 3148 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-iota 5335 df-fun 5377 df-fn 5378 df-fv 5383 df-ov 6081 |
| This theorem is referenced by: blrnps 15438 blrn 15439 tgioo 15581 |
| Copyright terms: Public domain | W3C validator |