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 5666 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → ran 𝐹 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)}) | |
2 | 1 | eleq2d 2148 | . 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ 𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)})) |
3 | elex 2610 | . . . 4 ⊢ (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} → 𝐶 ∈ V) | |
4 | 3 | a1i 9 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} → 𝐶 ∈ V)) |
5 | fnovex 5558 | . . . . . 6 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝑥𝐹𝑦) ∈ V) | |
6 | eleq1 2141 | . . . . . 6 ⊢ (𝐶 = (𝑥𝐹𝑦) → (𝐶 ∈ V ↔ (𝑥𝐹𝑦) ∈ V)) | |
7 | 5, 6 | syl5ibrcom 155 | . . . . 5 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V)) |
8 | 7 | 3expb 1139 | . . . 4 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → (𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V)) |
9 | 8 | rexlimdvva 2484 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦) → 𝐶 ∈ V)) |
10 | eqeq1 2087 | . . . . . 6 ⊢ (𝑧 = 𝐶 → (𝑧 = (𝑥𝐹𝑦) ↔ 𝐶 = (𝑥𝐹𝑦))) | |
11 | 10 | 2rexbidv 2391 | . . . . 5 ⊢ (𝑧 = 𝐶 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
12 | 11 | elabg 2739 | . . . 4 ⊢ (𝐶 ∈ V → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
13 | 12 | a1i 9 | . . 3 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ V → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦)))) |
14 | 4, 9, 13 | pm5.21ndd 653 | . 2 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = (𝑥𝐹𝑦)} ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
15 | 2, 14 | bitrd 186 | 1 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (𝐶 ∈ ran 𝐹 ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝐶 = (𝑥𝐹𝑦))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 ∧ w3a 919 = wceq 1284 ∈ wcel 1433 {cab 2067 ∃wrex 2349 Vcvv 2601 × cxp 4361 ran crn 4364 Fn wfn 4917 (class class class)co 5532 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-sep 3896 ax-pow 3948 ax-pr 3964 |
This theorem depends on definitions: df-bi 115 df-3an 921 df-tru 1287 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ral 2353 df-rex 2354 df-v 2603 df-sbc 2816 df-csb 2909 df-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-id 4048 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-iota 4887 df-fun 4924 df-fn 4925 df-fv 4930 df-ov 5535 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |