ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eusv2nf GIF version

Theorem eusv2nf 4487
Description: Two ways to express single-valuedness of a class expression 𝐴(𝑥). (Contributed by Mario Carneiro, 18-Nov-2016.)
Hypothesis
Ref Expression
eusv2.1 𝐴 ∈ V
Assertion
Ref Expression
eusv2nf (∃!𝑦𝑥 𝑦 = 𝐴𝑥𝐴)
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem eusv2nf
StepHypRef Expression
1 nfeu1 2053 . . . 4 𝑦∃!𝑦𝑥 𝑦 = 𝐴
2 nfe1 1507 . . . . . . 7 𝑥𝑥 𝑦 = 𝐴
32nfeu 2061 . . . . . 6 𝑥∃!𝑦𝑥 𝑦 = 𝐴
4 eusv2.1 . . . . . . . . 9 𝐴 ∈ V
54isseti 2768 . . . . . . . 8 𝑦 𝑦 = 𝐴
6 19.8a 1601 . . . . . . . . 9 (𝑦 = 𝐴 → ∃𝑥 𝑦 = 𝐴)
76ancri 324 . . . . . . . 8 (𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
85, 7eximii 1613 . . . . . . 7 𝑦(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴)
9 eupick 2121 . . . . . . 7 ((∃!𝑦𝑥 𝑦 = 𝐴 ∧ ∃𝑦(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴)) → (∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
108, 9mpan2 425 . . . . . 6 (∃!𝑦𝑥 𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
113, 10alrimi 1533 . . . . 5 (∃!𝑦𝑥 𝑦 = 𝐴 → ∀𝑥(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
12 nf3 1680 . . . . 5 (Ⅎ𝑥 𝑦 = 𝐴 ↔ ∀𝑥(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
1311, 12sylibr 134 . . . 4 (∃!𝑦𝑥 𝑦 = 𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
141, 13alrimi 1533 . . 3 (∃!𝑦𝑥 𝑦 = 𝐴 → ∀𝑦𝑥 𝑦 = 𝐴)
15 dfnfc2 3853 . . . 4 (∀𝑥 𝐴 ∈ V → (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴))
1615, 4mpg 1462 . . 3 (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴)
1714, 16sylibr 134 . 2 (∃!𝑦𝑥 𝑦 = 𝐴𝑥𝐴)
18 eusvnfb 4485 . . . 4 (∃!𝑦𝑥 𝑦 = 𝐴 ↔ (𝑥𝐴𝐴 ∈ V))
194, 18mpbiran2 943 . . 3 (∃!𝑦𝑥 𝑦 = 𝐴𝑥𝐴)
20 eusv2i 4486 . . 3 (∃!𝑦𝑥 𝑦 = 𝐴 → ∃!𝑦𝑥 𝑦 = 𝐴)
2119, 20sylbir 135 . 2 (𝑥𝐴 → ∃!𝑦𝑥 𝑦 = 𝐴)
2217, 21impbii 126 1 (∃!𝑦𝑥 𝑦 = 𝐴𝑥𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  wal 1362   = wceq 1364  wnf 1471  wex 1503  ∃!weu 2042  wcel 2164  wnfc 2323  Vcvv 2760
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-rex 2478  df-v 2762  df-sbc 2986  df-csb 3081  df-un 3157  df-sn 3624  df-pr 3625  df-uni 3836
This theorem is referenced by:  eusv2  4488
  Copyright terms: Public domain W3C validator