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

Theorem eusvobj2 6004
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 3740 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑧{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧})
2 eleq2 2295 . . . . . 6 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝑥 ∈ {𝑧}))
3 abid 2219 . . . . . 6 (𝑥 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ ∃𝑦𝐴 𝑥 = 𝐵)
4 velsn 3686 . . . . . 6 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
52, 3, 43bitr3g 222 . . . . 5 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝑧))
6 nfre1 2575 . . . . . . . . 9 𝑦𝑦𝐴 𝑥 = 𝐵
76nfab 2379 . . . . . . . 8 𝑦{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵}
87nfeq1 2384 . . . . . . 7 𝑦{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧}
9 eusvobj1.1 . . . . . . . . 9 𝐵 ∈ V
109elabrex 5898 . . . . . . . 8 (𝑦𝐴𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵})
11 eleq2 2295 . . . . . . . . 9 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝐵 ∈ {𝑧}))
129elsn 3685 . . . . . . . . . 10 (𝐵 ∈ {𝑧} ↔ 𝐵 = 𝑧)
13 eqcom 2233 . . . . . . . . . 10 (𝐵 = 𝑧𝑧 = 𝐵)
1412, 13bitri 184 . . . . . . . . 9 (𝐵 ∈ {𝑧} ↔ 𝑧 = 𝐵)
1511, 14bitrdi 196 . . . . . . . 8 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝑧 = 𝐵))
1610, 15imbitrid 154 . . . . . . 7 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑦𝐴𝑧 = 𝐵))
178, 16ralrimi 2603 . . . . . 6 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → ∀𝑦𝐴 𝑧 = 𝐵)
18 eqeq1 2238 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝐵𝑧 = 𝐵))
1918ralbidv 2532 . . . . . 6 (𝑥 = 𝑧 → (∀𝑦𝐴 𝑥 = 𝐵 ↔ ∀𝑦𝐴 𝑧 = 𝐵))
2017, 19syl5ibrcom 157 . . . . 5 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 = 𝑧 → ∀𝑦𝐴 𝑥 = 𝐵))
215, 20sylbid 150 . . . 4 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
2221exlimiv 1646 . . 3 (∃𝑧{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
231, 22sylbi 121 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
24 euex 2109 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑥𝑦𝐴 𝑥 = 𝐵)
25 rexm 3594 . . . 4 (∃𝑦𝐴 𝑥 = 𝐵 → ∃𝑦 𝑦𝐴)
2625exlimiv 1646 . . 3 (∃𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑦 𝑦𝐴)
27 r19.2m 3581 . . . 4 ((∃𝑦 𝑦𝐴 ∧ ∀𝑦𝐴 𝑥 = 𝐵) → ∃𝑦𝐴 𝑥 = 𝐵)
2827ex 115 . . 3 (∃𝑦 𝑦𝐴 → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
2924, 26, 283syl 17 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∀𝑦𝐴 𝑥 = 𝐵 → ∃𝑦𝐴 𝑥 = 𝐵))
3023, 29impbid 129 1 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵 ↔ ∀𝑦𝐴 𝑥 = 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105   = wceq 1397  wex 1540  ∃!weu 2079  wcel 2202  {cab 2217  wral 2510  wrex 2511  Vcvv 2802  {csn 3669
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-csb 3128  df-sn 3675
This theorem is referenced by:  eusvobj1  6005
  Copyright terms: Public domain W3C validator