MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  uniintsn Structured version   Visualization version   GIF version

Theorem uniintsn 4954
Description: Two ways to express "𝐴 is a singleton". See also en1 9021, en1b 9022, card1 9954, and eusn 4701. (Contributed by NM, 2-Aug-2010.)
Assertion
Ref Expression
uniintsn ( 𝐴 = 𝐴 ↔ ∃𝑥 𝐴 = {𝑥})
Distinct variable group:   𝑥,𝐴

Proof of Theorem uniintsn
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 vn0 4306 . . . . . 6 V ≠ ∅
2 inteq 4919 . . . . . . . . . . 11 (𝐴 = ∅ → 𝐴 = ∅)
3 int0 4931 . . . . . . . . . . 11 ∅ = V
42, 3eqtrdi 2820 . . . . . . . . . 10 (𝐴 = ∅ → 𝐴 = V)
54adantl 486 . . . . . . . . 9 (( 𝐴 = 𝐴𝐴 = ∅) → 𝐴 = V)
6 unieq 4887 . . . . . . . . . . . 12 (𝐴 = ∅ → 𝐴 = ∅)
7 uni0 4905 . . . . . . . . . . . 12 ∅ = ∅
86, 7eqtrdi 2820 . . . . . . . . . . 11 (𝐴 = ∅ → 𝐴 = ∅)
9 eqeq1 2773 . . . . . . . . . . 11 ( 𝐴 = 𝐴 → ( 𝐴 = ∅ ↔ 𝐴 = ∅))
108, 9imbitrid 247 . . . . . . . . . 10 ( 𝐴 = 𝐴 → (𝐴 = ∅ → 𝐴 = ∅))
1110imp 411 . . . . . . . . 9 (( 𝐴 = 𝐴𝐴 = ∅) → 𝐴 = ∅)
125, 11eqtr3d 2806 . . . . . . . 8 (( 𝐴 = 𝐴𝐴 = ∅) → V = ∅)
1312ex 417 . . . . . . 7 ( 𝐴 = 𝐴 → (𝐴 = ∅ → V = ∅))
1413necon3d 2985 . . . . . 6 ( 𝐴 = 𝐴 → (V ≠ ∅ → 𝐴 ≠ ∅))
151, 14mpi 21 . . . . 5 ( 𝐴 = 𝐴𝐴 ≠ ∅)
16 n0 4315 . . . . 5 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
1715, 16sylib 221 . . . 4 ( 𝐴 = 𝐴 → ∃𝑥 𝑥𝐴)
18 vex 3467 . . . . . . 7 𝑥 ∈ V
19 vex 3467 . . . . . . 7 𝑦 ∈ V
2018, 19prss 4790 . . . . . 6 ((𝑥𝐴𝑦𝐴) ↔ {𝑥, 𝑦} ⊆ 𝐴)
21 uniss 4884 . . . . . . . . . . . 12 ({𝑥, 𝑦} ⊆ 𝐴 {𝑥, 𝑦} ⊆ 𝐴)
2221adantl 486 . . . . . . . . . . 11 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴)
23 simpl 487 . . . . . . . . . . 11 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → 𝐴 = 𝐴)
2422, 23sseqtrd 3981 . . . . . . . . . 10 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴)
25 intss 4938 . . . . . . . . . . 11 ({𝑥, 𝑦} ⊆ 𝐴 𝐴 {𝑥, 𝑦})
2625adantl 486 . . . . . . . . . 10 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → 𝐴 {𝑥, 𝑦})
2724, 26sstrd 3955 . . . . . . . . 9 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → {𝑥, 𝑦} ⊆ {𝑥, 𝑦})
2818, 19unipr 4893 . . . . . . . . 9 {𝑥, 𝑦} = (𝑥𝑦)
2918, 19intpr 4951 . . . . . . . . 9 {𝑥, 𝑦} = (𝑥𝑦)
3027, 28, 293sstr3g 3997 . . . . . . . 8 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → (𝑥𝑦) ⊆ (𝑥𝑦))
31 inss1 4197 . . . . . . . . 9 (𝑥𝑦) ⊆ 𝑥
32 ssun1 4139 . . . . . . . . 9 𝑥 ⊆ (𝑥𝑦)
3331, 32sstri 3954 . . . . . . . 8 (𝑥𝑦) ⊆ (𝑥𝑦)
34 eqss 3960 . . . . . . . . 9 ((𝑥𝑦) = (𝑥𝑦) ↔ ((𝑥𝑦) ⊆ (𝑥𝑦) ∧ (𝑥𝑦) ⊆ (𝑥𝑦)))
35 uneqin 4250 . . . . . . . . 9 ((𝑥𝑦) = (𝑥𝑦) ↔ 𝑥 = 𝑦)
3634, 35bitr3i 280 . . . . . . . 8 (((𝑥𝑦) ⊆ (𝑥𝑦) ∧ (𝑥𝑦) ⊆ (𝑥𝑦)) ↔ 𝑥 = 𝑦)
3730, 33, 36sylanblc 600 . . . . . . 7 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → 𝑥 = 𝑦)
3837ex 417 . . . . . 6 ( 𝐴 = 𝐴 → ({𝑥, 𝑦} ⊆ 𝐴𝑥 = 𝑦))
3920, 38biimtrid 245 . . . . 5 ( 𝐴 = 𝐴 → ((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦))
4039alrimivv 1955 . . . 4 ( 𝐴 = 𝐴 → ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦))
4117, 40jca 520 . . 3 ( 𝐴 = 𝐴 → (∃𝑥 𝑥𝐴 ∧ ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦)))
42 euabsn 4697 . . . 4 (∃!𝑥 𝑥𝐴 ↔ ∃𝑥{𝑥𝑥𝐴} = {𝑥})
43 eleq1w 2852 . . . . 5 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
4443eu4 2649 . . . 4 (∃!𝑥 𝑥𝐴 ↔ (∃𝑥 𝑥𝐴 ∧ ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦)))
45 abid2 2906 . . . . . 6 {𝑥𝑥𝐴} = 𝐴
4645eqeq1i 2774 . . . . 5 ({𝑥𝑥𝐴} = {𝑥} ↔ 𝐴 = {𝑥})
4746exbii 1875 . . . 4 (∃𝑥{𝑥𝑥𝐴} = {𝑥} ↔ ∃𝑥 𝐴 = {𝑥})
4842, 44, 473bitr3i 304 . . 3 ((∃𝑥 𝑥𝐴 ∧ ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦)) ↔ ∃𝑥 𝐴 = {𝑥})
4941, 48sylib 221 . 2 ( 𝐴 = 𝐴 → ∃𝑥 𝐴 = {𝑥})
50 unisnv 4896 . . . 4 {𝑥} = 𝑥
51 unieq 4887 . . . 4 (𝐴 = {𝑥} → 𝐴 = {𝑥})
52 inteq 4919 . . . . 5 (𝐴 = {𝑥} → 𝐴 = {𝑥})
5318intsn 4953 . . . . 5 {𝑥} = 𝑥
5452, 53eqtrdi 2820 . . . 4 (𝐴 = {𝑥} → 𝐴 = 𝑥)
5550, 51, 543eqtr4a 2830 . . 3 (𝐴 = {𝑥} → 𝐴 = 𝐴)
5655exlimiv 1957 . 2 (∃𝑥 𝐴 = {𝑥} → 𝐴 = 𝐴)
5749, 56impbii 212 1 ( 𝐴 = 𝐴 ↔ ∃𝑥 𝐴 = {𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wal 1565   = wceq 1567  wex 1806  wcel 2149  ∃!weu 2602  {cab 2747  wne 2964  Vcvv 3463  cun 3911  cin 3912  wss 3913  c0 4294  {csn 4594  {cpr 4596   cuni 4876   cint 4916
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-sn 4595  df-pr 4597  df-uni 4877  df-int 4917
This theorem is referenced by:  uniintab  4955
  Copyright terms: Public domain W3C validator