Theorem funoprabg 6102

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 4783	. . 3 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
2	1	alrimiv 1920	. 2 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
3		dfoprab2 6050	. . . 4 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} = {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)}
4	3	funeqi 5338	. . 3 ⊢ (Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑} ↔ Fun {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)})
5		funopab 5352	. . 3 ⊢ (Fun {⟨𝑤, 𝑧⟩ ∣ ∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑)} ↔ ∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑))
6	4, 5	bitr2i 185	. 2 ⊢ (∀𝑤∃*𝑧∃𝑥∃𝑦(𝑤 = ⟨𝑥, 𝑦⟩ ∧ 𝜑) ↔ Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})
7	2, 6	sylib 122	1 ⊢ (∀𝑥∀𝑦∃*𝑧𝜑 → Fun {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ 𝜑})

Syntax hints:   → wi 4   ∧ wa 104  ∀wal 1393   = wceq 1395  ∃wex 1538  ∃*wmo 2078  ⟨cop 3669  {copab 4143  Fun wfun 5311  {coprab 6001

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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4083  df-opab 4145  df-id 4383  df-xp 4724  df-rel 4725  df-cnv 4726  df-co 4727  df-fun 5319  df-oprab 6004

This theorem is referenced by:  funoprab  6103  fnoprabg  6104  oprabexd  6270