Theorem funoprabg 5870

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 4604	. . 3 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2	1	alrimiv 1846	. 2 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3		dfoprab2 5818	. . . 4 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4	3	funeqi 5144	. . 3 ⊢ (Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ Fun {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)})
5		funopab 5158	. . 3 ⊢ (Fun {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↔ ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
6	4, 5	bitr2i 184	. 2 ⊢ (∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
7	2, 6	sylib 121	1 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})

Syntax hints:   → wi 4   ∧ wa 103  ∀wal 1329   = wceq 1331  ∃wex 1468  ∃*wmo 2000  ⟨cop 3530  {copab 3988  Fun wfun 5117  {coprab 5775

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-br 3930  df-opab 3990  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-fun 5125  df-oprab 5778

This theorem is referenced by:  funoprab  5871  fnoprabg  5872  oprabexd  6025