| 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 2647 | . . . . . 6 ⊢ (∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
| 2 | 1 | albii 1851 | . . . . 5 ⊢ (∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) |
| 3 | funopab 6584 | . . . . 5 ⊢ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ↔ ∀𝑥∃*𝑦(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 4 | df-ral 3081 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → ∃*𝑦𝜑)) | |
| 5 | 2, 3, 4 | 3bitr4ri 307 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ↔ Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)}) |
| 6 | dmopab3 5906 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦𝜑 ↔ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴) | |
| 7 | 5, 6 | anbi12i 640 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑) ↔ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∧ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴)) |
| 8 | r19.26 3126 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑) ↔ (∀𝑥 ∈ 𝐴 ∃*𝑦𝜑 ∧ ∀𝑥 ∈ 𝐴 ∃𝑦𝜑)) | |
| 9 | df-fn 6550 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴 ↔ (Fun {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} ∧ dom {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} = 𝐴)) | |
| 10 | 7, 8, 9 | 3bitr4i 306 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑) ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴) |
| 11 | df-eu 2597 | . . . 4 ⊢ (∃!𝑦𝜑 ↔ (∃𝑦𝜑 ∧ ∃*𝑦𝜑)) | |
| 12 | 11 | biancomi 468 | . . 3 ⊢ (∃!𝑦𝜑 ↔ (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) |
| 13 | 12 | ralbii 3112 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ ∀𝑥 ∈ 𝐴 (∃*𝑦𝜑 ∧ ∃𝑦𝜑)) |
| 14 | fnopabg.1 | . . 3 ⊢ 𝐹 = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} | |
| 15 | 14 | fneq1i 6647 | . 2 ⊢ (𝐹 Fn 𝐴 ↔ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝜑)} Fn 𝐴) |
| 16 | 10, 13, 15 | 3bitr4i 306 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∃!𝑦𝜑 ↔ 𝐹 Fn 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∀wal 1567 = wceq 1569 ∃wex 1811 ∈ wcel 2146 ∃*wmo 2565 ∃!weu 2596 ∀wral 3080 {copab 5170 dom cdm 5655 Fun wfun 6541 Fn wfn 6542 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-pr 5395 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4839 df-br 5107 df-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-fun 6549 df-fn 6550 |
| This theorem is used by: fnopab 6688 mptfng 6689 axcontlem2 29558 tfsconcatfn 44483 tfsconcatfv1 44484 tfsconcatfv2 44485 |
| Copyright terms: Public domain | W3C validator |