![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fnopabg | Structured version Visualization version 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 2560 | . . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
2 | 1 | albii 1787 | . . . . 5 ⊢ (∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) |
3 | funopab 5961 | . . . . 5 ⊢ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
4 | df-ral 2946 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
5 | 2, 3, 4 | 3bitr4ri 293 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ↔ Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
6 | dmopab3 5369 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦𝜑 ↔ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴) | |
7 | 5, 6 | anbi12i 733 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑) ↔ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∧ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴)) |
8 | r19.26 3093 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑) ↔ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑)) | |
9 | df-fn 5929 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴 ↔ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∧ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴)) | |
10 | 7, 8, 9 | 3bitr4i 292 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑) ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴) |
11 | eu5 2524 | . . . 4 ⊢ (∃!𝑦𝜑 ↔ (∃𝑦𝜑 ∧ ∃*𝑦𝜑)) | |
12 | ancom 465 | . . . 4 ⊢ ((∃𝑦𝜑 ∧ ∃*𝑦𝜑) ↔ (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) | |
13 | 11, 12 | bitri 264 | . . 3 ⊢ (∃!𝑦𝜑 ↔ (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) |
14 | 13 | ralbii 3009 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ ∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) |
15 | fnopabg.1 | . . 3 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
16 | 15 | fneq1i 6023 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴) |
17 | 10, 14, 16 | 3bitr4i 292 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ 𝐹 Fn 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 383 ∀wal 1521 = wceq 1523 ∃wex 1744 ∈ wcel 2030 ∃!weu 2498 ∃*wmo 2499 ∀wral 2941 {copab 4745 dom cdm 5143 Fun wfun 5920 Fn wfn 5921 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pr 4936 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ral 2946 df-rab 2950 df-v 3233 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-sn 4211 df-pr 4213 df-op 4217 df-br 4686 df-opab 4746 df-id 5053 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-fun 5928 df-fn 5929 |
This theorem is referenced by: fnopab 6056 mptfng 6057 axcontlem2 25890 |
Copyright terms: Public domain | W3C validator |