MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fnoprabg Structured version   Visualization version   GIF version

Theorem fnoprabg 7572
Description: Functionality and domain of an operation class abstraction. (Contributed by NM, 28-Aug-2007.)
Assertion
Ref Expression
fnoprabg (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} Fn {⟨𝑥, 𝑦⟩ ∣ 𝜑})
Distinct variable groups:   𝑥,𝑦,𝑧   𝜑,𝑧
Allowed substitution hints:   𝜑(𝑥, 𝑦)   𝜓(𝑥, 𝑦, 𝑧)

Proof of Theorem fnoprabg
StepHypRef Expression
1 eumo 2606 . . . . . 6 (∃!𝑧𝜓 → ∃*𝑧𝜓)
21imim2i 17 . . . . 5 ((𝜑 → ∃!𝑧𝜓) → (𝜑 → ∃*𝑧𝜓))
3 moanimv 2647 . . . . 5 (∃*𝑧(𝜑 ∧ 𝜓) ↔ (𝜑 → ∃*𝑧𝜓))
42, 3sylibr 237 . . . 4 ((𝜑 → ∃!𝑧𝜓) → ∃*𝑧(𝜑 ∧ 𝜓))
542alimi 1845 . . 3 (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → ∀𝑥∀𝑦∃*𝑧(𝜑 ∧ 𝜓))
6 funoprabg 7570 . . 3 (∀𝑥∀𝑦∃*𝑧(𝜑 ∧ 𝜓) → Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)})
75, 6syl 18 . 2 (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)})
8 dmoprab 7552 . . 3 dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧(𝜑 ∧ 𝜓)}
9 nfa1 2191 . . . 4 Ⅎ𝑥∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓)
10 nfa2 2213 . . . 4 Ⅎ𝑦∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓)
11 simpl 488 . . . . . . . 8 ((𝜑 ∧ 𝜓) → 𝜑)
1211exlimiv 1965 . . . . . . 7 (∃𝑧(𝜑 ∧ 𝜓) → 𝜑)
13 euex 2605 . . . . . . . . . 10 (∃!𝑧𝜓 → ∃𝑧𝜓)
1413imim2i 17 . . . . . . . . 9 ((𝜑 → ∃!𝑧𝜓) → (𝜑 → ∃𝑧𝜓))
1514ancld 560 . . . . . . . 8 ((𝜑 → ∃!𝑧𝜓) → (𝜑 → (𝜑 ∧ ∃𝑧𝜓)))
16 19.42v 1988 . . . . . . . 8 (∃𝑧(𝜑 ∧ 𝜓) ↔ (𝜑 ∧ ∃𝑧𝜓))
1715, 16imbitrrdi 255 . . . . . . 7 ((𝜑 → ∃!𝑧𝜓) → (𝜑 → ∃𝑧(𝜑 ∧ 𝜓)))
1812, 17impbid2 229 . . . . . 6 ((𝜑 → ∃!𝑧𝜓) → (∃𝑧(𝜑 ∧ 𝜓) ↔ 𝜑))
1918sps 2225 . . . . 5 (∀𝑦(𝜑 → ∃!𝑧𝜓) → (∃𝑧(𝜑 ∧ 𝜓) ↔ 𝜑))
2019sps 2225 . . . 4 (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → (∃𝑧(𝜑 ∧ 𝜓) ↔ 𝜑))
219, 10, 20opabbid 5174 . . 3 (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → {⟨𝑥, 𝑦⟩ ∣ ∃𝑧(𝜑 ∧ 𝜓)} = {⟨𝑥, 𝑦⟩ ∣ 𝜑})
228, 21eqtrid 2810 . 2 (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} = {⟨𝑥, 𝑦⟩ ∣ 𝜑})
23 df-fn 6567 . 2 ({⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} Fn {⟨𝑥, 𝑦⟩ ∣ 𝜑} ↔ (Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} ∧ dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} = {⟨𝑥, 𝑦⟩ ∣ 𝜑}))
247, 22, 23sylanbrc 595 1 (∀𝑥∀𝑦(𝜑 → ∃!𝑧𝜓) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ (𝜑 ∧ 𝜓)} Fn {⟨𝑥, 𝑦⟩ ∣ 𝜑})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1568   = wceq 1570  ∃wex 1812  ∃*wmo 2565  ∃!weu 2596  {copab 5171  dom cdm 5656  Fun wfun 6558   Fn wfn 6559  {coprab 7450
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  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 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-fun 6566  df-fn 6567  df-oprab 7453
This theorem is used by:  fnoprab  7574  ovg  7615
  Copyright terms: Public domain W3C validator