Theorem funoprabg 6119

Description: "At most one" is a sufficient condition for an operation class abstraction to be a function. (Contributed by NM, 28-Aug-2007.)

Assertion

Ref	Expression
funoprabg	⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})

Distinct variable group:   𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem funoprabg

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mosubopt 4791	. . 3 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2	1	alrimiv 1922	. 2 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3		dfoprab2 6067	. . . 4 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4	3	funeqi 5347	. . 3 ⊢ (Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ Fun {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)})
5		funopab 5361	. . 3 ⊢ (Fun {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↔ ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
6	4, 5	bitr2i 185	. 2 ⊢ (∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
7	2, 6	sylib 122	1 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1395   = wceq 1397  ∃wex 1540  ∃*wmo 2080  ⟨cop 3672  {copab 4149  Fun wfun 5320  {coprab 6018

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-fun 5328  df-oprab 6021

This theorem is referenced by:  funoprab  6120  fnoprabg  6121  oprabexd  6288