| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fnopabg | GIF version | ||
| Description: Functionality and domain of an ordered-pair class abstraction. (Contributed by NM, 30-Jan-2004.) (Proof shortened by Mario Carneiro, 4-Dec-2016.) |
| Ref | Expression |
|---|---|
| fnopabg.1 | ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} |
| Ref | Expression |
|---|---|
| fnopabg | ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ 𝐹 Fn 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | moanimv 2016 | . . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
| 2 | 1 | albii 1399 | . . . . 5 ⊢ (∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) |
| 3 | funopab 4955 | . . . . 5 ⊢ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 4 | df-ral 2353 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
| 5 | 2, 3, 4 | 3bitr4ri 211 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ↔ Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
| 6 | dmopab3 4566 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦𝜑 ↔ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴) | |
| 7 | 5, 6 | anbi12i 447 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑) ↔ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∧ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴)) |
| 8 | r19.26 2485 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑) ↔ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑)) | |
| 9 | df-fn 4925 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴 ↔ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∧ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴)) | |
| 10 | 7, 8, 9 | 3bitr4i 210 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑) ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴) |
| 11 | eu5 1988 | . . . 4 ⊢ (∃!𝑦𝜑 ↔ (∃𝑦𝜑 ∧ ∃*𝑦𝜑)) | |
| 12 | ancom 262 | . . . 4 ⊢ ((∃𝑦𝜑 ∧ ∃*𝑦𝜑) ↔ (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) | |
| 13 | 11, 12 | bitri 182 | . . 3 ⊢ (∃!𝑦𝜑 ↔ (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) |
| 14 | 13 | ralbii 2372 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ ∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) |
| 15 | fnopabg.1 | . . 3 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
| 16 | 15 | fneq1i 5013 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴) |
| 17 | 10, 14, 16 | 3bitr4i 210 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ 𝐹 Fn 𝐴) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∀wal 1282 = wceq 1284 ∃wex 1421 ∈ wcel 1433 ∃!weu 1941 ∃*wmo 1942 ∀wral 2348 {copab 3838 dom cdm 4363 Fun wfun 4916 Fn wfn 4917 |
| 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-dm 4373 df-fun 4924 df-fn 4925 |
| This theorem is referenced by: fnopab 5043 mptfng 5044 |
| Copyright terms: Public domain | W3C validator |