Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ovid | GIF version |
Description: The value of an operation class abstraction. (Contributed by NM, 16-May-1995.) (Revised by David Abernethy, 19-Jun-2012.) |
Ref | Expression |
---|---|
ovid.1 | ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃!𝑧𝜑) |
ovid.2 | ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} |
Ref | Expression |
---|---|
ovid | ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = 𝑧 ↔ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-ov 5854 | . . 3 ⊢ (𝑥𝐹𝑦) = (𝐹‘〈𝑥, 𝑦〉) | |
2 | 1 | eqeq1i 2178 | . 2 ⊢ ((𝑥𝐹𝑦) = 𝑧 ↔ (𝐹‘〈𝑥, 𝑦〉) = 𝑧) |
3 | ovid.1 | . . . . . 6 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ∃!𝑧𝜑) | |
4 | 3 | fnoprab 5954 | . . . . 5 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} Fn {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} |
5 | ovid.2 | . . . . . 6 ⊢ 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} | |
6 | 5 | fneq1i 5290 | . . . . 5 ⊢ (𝐹 Fn {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} ↔ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} Fn {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)}) |
7 | 4, 6 | mpbir 145 | . . . 4 ⊢ 𝐹 Fn {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} |
8 | opabid 4240 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} ↔ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)) | |
9 | 8 | biimpri 132 | . . . 4 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → 〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)}) |
10 | fnopfvb 5536 | . . . 4 ⊢ ((𝐹 Fn {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)} ∧ 〈𝑥, 𝑦〉 ∈ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆)}) → ((𝐹‘〈𝑥, 𝑦〉) = 𝑧 ↔ 〈〈𝑥, 𝑦〉, 𝑧〉 ∈ 𝐹)) | |
11 | 7, 9, 10 | sylancr 412 | . . 3 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝐹‘〈𝑥, 𝑦〉) = 𝑧 ↔ 〈〈𝑥, 𝑦〉, 𝑧〉 ∈ 𝐹)) |
12 | 5 | eleq2i 2237 | . . . . 5 ⊢ (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ 𝐹 ↔ 〈〈𝑥, 𝑦〉, 𝑧〉 ∈ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)}) |
13 | oprabid 5883 | . . . . 5 ⊢ (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)} ↔ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)) | |
14 | 12, 13 | bitri 183 | . . . 4 ⊢ (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ 𝐹 ↔ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) ∧ 𝜑)) |
15 | 14 | baib 914 | . . 3 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → (〈〈𝑥, 𝑦〉, 𝑧〉 ∈ 𝐹 ↔ 𝜑)) |
16 | 11, 15 | bitrd 187 | . 2 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝐹‘〈𝑥, 𝑦〉) = 𝑧 ↔ 𝜑)) |
17 | 2, 16 | syl5bb 191 | 1 ⊢ ((𝑥 ∈ 𝑅 ∧ 𝑦 ∈ 𝑆) → ((𝑥𝐹𝑦) = 𝑧 ↔ 𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1348 ∃!weu 2019 ∈ wcel 2141 〈cop 3584 {copab 4047 Fn wfn 5191 ‘cfv 5196 (class class class)co 5851 {coprab 5852 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 609 ax-in2 610 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4105 ax-pow 4158 ax-pr 4192 ax-setind 4519 |
This theorem depends on definitions: df-bi 116 df-3an 975 df-tru 1351 df-fal 1354 df-nf 1454 df-sb 1756 df-eu 2022 df-mo 2023 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-ne 2341 df-ral 2453 df-rex 2454 df-v 2732 df-sbc 2956 df-dif 3123 df-un 3125 df-in 3127 df-ss 3134 df-pw 3566 df-sn 3587 df-pr 3588 df-op 3590 df-uni 3795 df-br 3988 df-opab 4049 df-id 4276 df-xp 4615 df-rel 4616 df-cnv 4617 df-co 4618 df-dm 4619 df-iota 5158 df-fun 5198 df-fn 5199 df-fv 5204 df-ov 5854 df-oprab 5855 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |