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

Theorem eusv2nf 4491
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 2056 . . . 4 𝑦∃!𝑦𝑥 𝑦 = 𝐴
2 nfe1 1510 . . . . . . 7 𝑥𝑥 𝑦 = 𝐴
32nfeu 2064 . . . . . 6 𝑥∃!𝑦𝑥 𝑦 = 𝐴
4 eusv2.1 . . . . . . . . 9 𝐴 ∈ V
54isseti 2771 . . . . . . . 8 𝑦 𝑦 = 𝐴
6 19.8a 1604 . . . . . . . . 9 (𝑦 = 𝐴 → ∃𝑥 𝑦 = 𝐴)
76ancri 324 . . . . . . . 8 (𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
85, 7eximii 1616 . . . . . . 7 𝑦(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴)
9 eupick 2124 . . . . . . 7 ((∃!𝑦𝑥 𝑦 = 𝐴 ∧ ∃𝑦(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴)) → (∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
108, 9mpan2 425 . . . . . 6 (∃!𝑦𝑥 𝑦 = 𝐴 → (∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
113, 10alrimi 1536 . . . . 5 (∃!𝑦𝑥 𝑦 = 𝐴 → ∀𝑥(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
12 nf3 1683 . . . . 5 (Ⅎ𝑥 𝑦 = 𝐴 ↔ ∀𝑥(∃𝑥 𝑦 = 𝐴𝑦 = 𝐴))
1311, 12sylibr 134 . . . 4 (∃!𝑦𝑥 𝑦 = 𝐴 → Ⅎ𝑥 𝑦 = 𝐴)
141, 13alrimi 1536 . . 3 (∃!𝑦𝑥 𝑦 = 𝐴 → ∀𝑦𝑥 𝑦 = 𝐴)
15 dfnfc2 3857 . . . 4 (∀𝑥 𝐴 ∈ V → (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴))
1615, 4mpg 1465 . . 3 (𝑥𝐴 ↔ ∀𝑦𝑥 𝑦 = 𝐴)
1714, 16sylibr 134 . 2 (∃!𝑦𝑥 𝑦 = 𝐴𝑥𝐴)
18 eusvnfb 4489 . . . 4 (∃!𝑦𝑥 𝑦 = 𝐴 ↔ (𝑥𝐴𝐴 ∈ V))
194, 18mpbiran2 943 . . 3 (∃!𝑦𝑥 𝑦 = 𝐴𝑥𝐴)
20 eusv2i 4490 . . 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 1474  wex 1506  ∃!weu 2045  wcel 2167  wnfc 2326  Vcvv 2763
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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178
This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-rex 2481  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-sn 3628  df-pr 3629  df-uni 3840
This theorem is referenced by:  eusv2  4492
  Copyright terms: Public domain W3C validator