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

Theorem eusvobj2 5937
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 3703 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 ↔ ∃𝑧{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧})
2 eleq2 2270 . . . . . 6 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝑥 ∈ {𝑧}))
3 abid 2194 . . . . . 6 (𝑥 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ ∃𝑦𝐴 𝑥 = 𝐵)
4 velsn 3651 . . . . . 6 (𝑥 ∈ {𝑧} ↔ 𝑥 = 𝑧)
52, 3, 43bitr3g 222 . . . . 5 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵𝑥 = 𝑧))
6 nfre1 2550 . . . . . . . . 9 𝑦𝑦𝐴 𝑥 = 𝐵
76nfab 2354 . . . . . . . 8 𝑦{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵}
87nfeq1 2359 . . . . . . 7 𝑦{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧}
9 eusvobj1.1 . . . . . . . . 9 𝐵 ∈ V
109elabrex 5833 . . . . . . . 8 (𝑦𝐴𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵})
11 eleq2 2270 . . . . . . . . 9 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝐵 ∈ {𝑧}))
129elsn 3650 . . . . . . . . . 10 (𝐵 ∈ {𝑧} ↔ 𝐵 = 𝑧)
13 eqcom 2208 . . . . . . . . . 10 (𝐵 = 𝑧𝑧 = 𝐵)
1412, 13bitri 184 . . . . . . . . 9 (𝐵 ∈ {𝑧} ↔ 𝑧 = 𝐵)
1511, 14bitrdi 196 . . . . . . . 8 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝐵 ∈ {𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} ↔ 𝑧 = 𝐵))
1610, 15imbitrid 154 . . . . . . 7 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑦𝐴𝑧 = 𝐵))
178, 16ralrimi 2578 . . . . . 6 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → ∀𝑦𝐴 𝑧 = 𝐵)
18 eqeq1 2213 . . . . . . 7 (𝑥 = 𝑧 → (𝑥 = 𝐵𝑧 = 𝐵))
1918ralbidv 2507 . . . . . 6 (𝑥 = 𝑧 → (∀𝑦𝐴 𝑥 = 𝐵 ↔ ∀𝑦𝐴 𝑧 = 𝐵))
2017, 19syl5ibrcom 157 . . . . 5 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (𝑥 = 𝑧 → ∀𝑦𝐴 𝑥 = 𝐵))
215, 20sylbid 150 . . . 4 ({𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
2221exlimiv 1622 . . 3 (∃𝑧{𝑥 ∣ ∃𝑦𝐴 𝑥 = 𝐵} = {𝑧} → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
231, 22sylbi 121 . 2 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → (∃𝑦𝐴 𝑥 = 𝐵 → ∀𝑦𝐴 𝑥 = 𝐵))
24 euex 2085 . . 3 (∃!𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑥𝑦𝐴 𝑥 = 𝐵)
25 rexm 3561 . . . 4 (∃𝑦𝐴 𝑥 = 𝐵 → ∃𝑦 𝑦𝐴)
2625exlimiv 1622 . . 3 (∃𝑥𝑦𝐴 𝑥 = 𝐵 → ∃𝑦 𝑦𝐴)
27 r19.2m 3548 . . . 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 1373  wex 1516  ∃!weu 2055  wcel 2177  {cab 2192  wral 2485  wrex 2486  Vcvv 2773  {csn 3634
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 711  ax-5 1471  ax-7 1472  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-8 1528  ax-10 1529  ax-11 1530  ax-i12 1531  ax-bndl 1533  ax-4 1534  ax-17 1550  ax-i9 1554  ax-ial 1558  ax-i5r 1559  ax-ext 2188
This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1485  df-sb 1787  df-eu 2058  df-clab 2193  df-cleq 2199  df-clel 2202  df-nfc 2338  df-ral 2490  df-rex 2491  df-v 2775  df-sbc 3000  df-csb 3095  df-sn 3640
This theorem is referenced by:  eusvobj1  5938
  Copyright terms: Public domain W3C validator