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

Theorem funop 6888
Description: An ordered pair is a function iff it is a singleton of an ordered pair. (Contributed by AV, 20-Sep-2020.) A function is a class of ordered pairs, so the fact that an ordered pair may sometimes be itself a function is an "accident" depending on the specific encoding of ordered pairs as classes (in set.mm, the Kuratowski encoding). A more meaningful statement is funsng 6375, as relsnopg 5640 is to relop 5685. (New usage is discouraged.)
Hypotheses
Ref Expression
funopsn.x 𝑋 ∈ V
funopsn.y 𝑌 ∈ V
Assertion
Ref Expression
funop (Fun ⟨𝑋, 𝑌⟩ ↔ ∃𝑎(𝑋 = {𝑎} ∧ ⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩}))
Distinct variable groups:   𝑋,𝑎   𝑌,𝑎

Proof of Theorem funop
StepHypRef Expression
1 eqid 2798 . . 3 𝑋, 𝑌⟩ = ⟨𝑋, 𝑌
2 funopsn.x . . . 4 𝑋 ∈ V
3 funopsn.y . . . 4 𝑌 ∈ V
42, 3funopsn 6887 . . 3 ((Fun ⟨𝑋, 𝑌⟩ ∧ ⟨𝑋, 𝑌⟩ = ⟨𝑋, 𝑌⟩) → ∃𝑎(𝑋 = {𝑎} ∧ ⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩}))
51, 4mpan2 690 . 2 (Fun ⟨𝑋, 𝑌⟩ → ∃𝑎(𝑋 = {𝑎} ∧ ⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩}))
6 vex 3444 . . . . . 6 𝑎 ∈ V
76, 6funsn 6377 . . . . 5 Fun {⟨𝑎, 𝑎⟩}
8 funeq 6344 . . . . 5 (⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩} → (Fun ⟨𝑋, 𝑌⟩ ↔ Fun {⟨𝑎, 𝑎⟩}))
97, 8mpbiri 261 . . . 4 (⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩} → Fun ⟨𝑋, 𝑌⟩)
109adantl 485 . . 3 ((𝑋 = {𝑎} ∧ ⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩}) → Fun ⟨𝑋, 𝑌⟩)
1110exlimiv 1931 . 2 (∃𝑎(𝑋 = {𝑎} ∧ ⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩}) → Fun ⟨𝑋, 𝑌⟩)
125, 11impbii 212 1 (Fun ⟨𝑋, 𝑌⟩ ↔ ∃𝑎(𝑋 = {𝑎} ∧ ⟨𝑋, 𝑌⟩ = {⟨𝑎, 𝑎⟩}))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399   = wceq 1538  wex 1781  wcel 2111  Vcvv 3441  {csn 4525  cop 4531  Fun wfun 6318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-fal 1551  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-reu 3113  df-v 3443  df-sbc 3721  df-csb 3829  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-if 4426  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-iun 4883  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332
This theorem is referenced by:  funopdmsn  6889  funsndifnop  6890
  Copyright terms: Public domain W3C validator