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

Theorem eusvobj2 5828
Description: Specify the same property in two ways when class 𝐵(𝑦) is single-valued. (Contributed by NM, 1-Nov-2010.) (Proof shortened by Mario Carneiro, 24-Dec-2016.)
Hypothesis
Ref Expression
eusvobj1.1 𝐵 ∈ V
Assertion
Ref Expression
eusvobj2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵 ↔ ∀𝑦𝐴 𝑥 = 𝐵))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐵(𝑦)

Proof of Theorem eusvobj2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 euabsn2 3645 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑧{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧})
2 eleq2 2230 . . . . . 6 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝑥 ∈ {𝑧}))
3 abid 2153 . . . . . 6 (𝑥 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ ∃𝑦𝐴 𝑥 = 𝐵)
4 velsn 3593 . . . . . 6 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
52, 3, 43bitr3g 221 . . . . 5 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝑧))
6 nfre1 2509 . . . . . . . . 9 𝑦𝑦𝐴 𝑥 = 𝐵
76nfab 2313 . . . . . . . 8 𝑦{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵}
87nfeq1 2318 . . . . . . 7 𝑦{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧}
9 eusvobj1.1 . . . . . . . . 9 𝐵 ∈ V
109elabrex 5726 . . . . . . . 8 (𝑦𝐴𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵})
11 eleq2 2230 . . . . . . . . 9 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝐵 ∈ {𝑧}))
129elsn 3592 . . . . . . . . . 10 (𝐵 ∈ {𝑧} ↔ 𝐵 = 𝑧)
13 eqcom 2167 . . . . . . . . . 10 (𝐵 = 𝑧𝑧 = 𝐵)
1412, 13bitri 183 . . . . . . . . 9 (𝐵 ∈ {𝑧} ↔ 𝑧 = 𝐵)
1511, 14bitrdi 195 . . . . . . . 8 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝑧 = 𝐵))
1610, 15syl5ib 153 . . . . . . 7 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑦𝐴𝑧 = 𝐵))
178, 16ralrimi 2537 . . . . . 6 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → ∀𝑦𝐴 𝑧 = 𝐵)
18 eqeq1 2172 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝐵𝑧 = 𝐵))
1918ralbidv 2466 . . . . . 6 (𝑥 = 𝑧 → (∀𝑦𝐴 𝑥 = 𝐵 ↔ ∀𝑦𝐴 𝑧 = 𝐵))
2017, 19syl5ibrcom 156 . . . . 5 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 = 𝑧 → ∀𝑦𝐴 𝑥 = 𝐵))
215, 20sylbid 149 . . . 4 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
2221exlimiv 1586 . . 3 (∃𝑧{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
231, 22sylbi 120 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
24 euex 2044 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑥𝑦𝐴 𝑥 = 𝐵)
25 rexm 3508 . . . 4 (∃𝑦𝐴 𝑥 = 𝐵 → ∃𝑦 𝑦𝐴)
2625exlimiv 1586 . . 3 (∃𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑦 𝑦𝐴)
27 r19.2m 3495 . . . 4 ((∃𝑦 𝑦𝐴 ∧ ∀𝑦𝐴 𝑥 = 𝐵) → ∃𝑦𝐴 𝑥 = 𝐵)
2827ex 114 . . 3 (∃𝑦 𝑦𝐴 → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
2924, 26, 283syl 17 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
3023, 29impbid 128 1 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵 ↔ ∀𝑦𝐴 𝑥 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 104   = wceq 1343  wex 1480  ∃!weu 2014  wcel 2136  {cab 2151  wral 2444  wrex 2445  Vcvv 2726  {csn 3576
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 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-tru 1346  df-nf 1449  df-sb 1751  df-eu 2017  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449  df-rex 2450  df-v 2728  df-sbc 2952  df-csb 3046  df-sn 3582
This theorem is referenced by:  eusvobj1  5829
  Copyright terms: Public domain W3C validator