![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > funoprabg | GIF version |
Description: "At most one" is a sufficient condition for an operation class abstraction to be a function. (Contributed by NM, 28-Aug-2007.) |
Ref | Expression |
---|---|
funoprabg | ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mosubopt 4423 | . . 3 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∃*𝑧∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
2 | 1 | alrimiv 1795 | . 2 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) |
3 | dfoprab2 5572 | . . . 4 ⊢ {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} = {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} | |
4 | 3 | funeqi 4942 | . . 3 ⊢ (Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑} ↔ Fun {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)}) |
5 | funopab 4955 | . . 3 ⊢ (Fun {〈𝑤, 𝑧〉 ∣ ∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)} ↔ ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑)) | |
6 | 4, 5 | bitr2i 183 | . 2 ⊢ (∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = 〈𝑥, 𝑦〉 ∧ 𝜑) ↔ Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑}) |
7 | 2, 6 | sylib 120 | 1 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ 𝜑}) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ∀wal 1282 = wceq 1284 ∃wex 1421 ∃*wmo 1942 〈cop 3401 {copab 3838 Fun wfun 4916 {coprab 5533 |
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-un 2977 df-in 2979 df-ss 2986 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-br 3786 df-opab 3840 df-id 4048 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-fun 4924 df-oprab 5536 |
This theorem is referenced by: funoprab 5621 fnoprabg 5622 oprabexd 5774 |
Copyright terms: Public domain | W3C validator |