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

Theorem uniintsn 4915
Description: Two ways to express "𝐴 is a singleton". See also en1 8961, en1b 8962, card1 9883, and eusn 4662. (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 4273 . . . . . 6 V ≠ ∅
2 inteq 4880 . . . . . . . . . . 11 (𝐴 = ∅ → 𝐴 = ∅)
3 int0 4892 . . . . . . . . . . 11 ∅ = V
42, 3eqtrdi 2790 . . . . . . . . . 10 (𝐴 = ∅ → 𝐴 = V)
54adantl 482 . . . . . . . . 9 (( 𝐴 = 𝐴𝐴 = ∅) → 𝐴 = V)
6 unieq 4849 . . . . . . . . . . . 12 (𝐴 = ∅ → 𝐴 = ∅)
7 uni0 4866 . . . . . . . . . . . 12 ∅ = ∅
86, 7eqtrdi 2790 . . . . . . . . . . 11 (𝐴 = ∅ → 𝐴 = ∅)
9 eqeq1 2743 . . . . . . . . . . 11 ( 𝐴 = 𝐴 → ( 𝐴 = ∅ ↔ 𝐴 = ∅))
108, 9imbitrid 245 . . . . . . . . . 10 ( 𝐴 = 𝐴 → (𝐴 = ∅ → 𝐴 = ∅))
1110imp 407 . . . . . . . . 9 (( 𝐴 = 𝐴𝐴 = ∅) → 𝐴 = ∅)
125, 11eqtr3d 2776 . . . . . . . 8 (( 𝐴 = 𝐴𝐴 = ∅) → V = ∅)
1312ex 413 . . . . . . 7 ( 𝐴 = 𝐴 → (𝐴 = ∅ → V = ∅))
1413necon3d 2955 . . . . . 6 ( 𝐴 = 𝐴 → (V ≠ ∅ → 𝐴 ≠ ∅))
151, 14mpi 20 . . . . 5 ( 𝐴 = 𝐴𝐴 ≠ ∅)
16 n0 4281 . . . . 5 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
1715, 16sylib 219 . . . 4 ( 𝐴 = 𝐴 → ∃𝑥 𝑥𝐴)
18 vex 3435 . . . . . . 7 𝑥 ∈ V
19 vex 3435 . . . . . . 7 𝑦 ∈ V
2018, 19prss 4751 . . . . . 6 ((𝑥𝐴𝑦𝐴) ↔ {𝑥, 𝑦} ⊆ 𝐴)
21 uniss 4846 . . . . . . . . . . . 12 ({𝑥, 𝑦} ⊆ 𝐴 {𝑥, 𝑦} ⊆ 𝐴)
2221adantl 482 . . . . . . . . . . 11 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴)
23 simpl 483 . . . . . . . . . . 11 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → 𝐴 = 𝐴)
2422, 23sseqtrd 3951 . . . . . . . . . 10 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → {𝑥, 𝑦} ⊆ 𝐴)
25 intss 4899 . . . . . . . . . . 11 ({𝑥, 𝑦} ⊆ 𝐴 𝐴 {𝑥, 𝑦})
2625adantl 482 . . . . . . . . . 10 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → 𝐴 {𝑥, 𝑦})
2724, 26sstrd 3925 . . . . . . . . 9 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → {𝑥, 𝑦} ⊆ {𝑥, 𝑦})
2818, 19unipr 4855 . . . . . . . . 9 {𝑥, 𝑦} = (𝑥𝑦)
2918, 19intpr 4912 . . . . . . . . 9 {𝑥, 𝑦} = (𝑥𝑦)
3027, 28, 293sstr3g 3967 . . . . . . . 8 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → (𝑥𝑦) ⊆ (𝑥𝑦))
31 inss1 4165 . . . . . . . . 9 (𝑥𝑦) ⊆ 𝑥
32 ssun1 4107 . . . . . . . . 9 𝑥 ⊆ (𝑥𝑦)
3331, 32sstri 3924 . . . . . . . 8 (𝑥𝑦) ⊆ (𝑥𝑦)
34 eqss 3930 . . . . . . . . 9 ((𝑥𝑦) = (𝑥𝑦) ↔ ((𝑥𝑦) ⊆ (𝑥𝑦) ∧ (𝑥𝑦) ⊆ (𝑥𝑦)))
35 uneqin 4217 . . . . . . . . 9 ((𝑥𝑦) = (𝑥𝑦) ↔ 𝑥 = 𝑦)
3634, 35bitr3i 278 . . . . . . . 8 (((𝑥𝑦) ⊆ (𝑥𝑦) ∧ (𝑥𝑦) ⊆ (𝑥𝑦)) ↔ 𝑥 = 𝑦)
3730, 33, 36sylanblc 595 . . . . . . 7 (( 𝐴 = 𝐴 ∧ {𝑥, 𝑦} ⊆ 𝐴) → 𝑥 = 𝑦)
3837ex 413 . . . . . 6 ( 𝐴 = 𝐴 → ({𝑥, 𝑦} ⊆ 𝐴𝑥 = 𝑦))
3920, 38biimtrid 243 . . . . 5 ( 𝐴 = 𝐴 → ((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦))
4039alrimivv 1935 . . . 4 ( 𝐴 = 𝐴 → ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦))
4117, 40jca 516 . . 3 ( 𝐴 = 𝐴 → (∃𝑥 𝑥𝐴 ∧ ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦)))
42 euabsn 4658 . . . 4 (∃!𝑥 𝑥𝐴 ↔ ∃𝑥{𝑥𝑥𝐴} = {𝑥})
43 eleq1w 2822 . . . . 5 (𝑥 = 𝑦 → (𝑥𝐴𝑦𝐴))
4443eu4 2619 . . . 4 (∃!𝑥 𝑥𝐴 ↔ (∃𝑥 𝑥𝐴 ∧ ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦)))
45 abid2 2876 . . . . . 6 {𝑥𝑥𝐴} = 𝐴
4645eqeq1i 2744 . . . . 5 ({𝑥𝑥𝐴} = {𝑥} ↔ 𝐴 = {𝑥})
4746exbii 1855 . . . 4 (∃𝑥{𝑥𝑥𝐴} = {𝑥} ↔ ∃𝑥 𝐴 = {𝑥})
4842, 44, 473bitr3i 302 . . 3 ((∃𝑥 𝑥𝐴 ∧ ∀𝑥𝑦((𝑥𝐴𝑦𝐴) → 𝑥 = 𝑦)) ↔ ∃𝑥 𝐴 = {𝑥})
4941, 48sylib 219 . 2 ( 𝐴 = 𝐴 → ∃𝑥 𝐴 = {𝑥})
50 unisnv 4858 . . . 4 {𝑥} = 𝑥
51 unieq 4849 . . . 4 (𝐴 = {𝑥} → 𝐴 = {𝑥})
52 inteq 4880 . . . . 5 (𝐴 = {𝑥} → 𝐴 = {𝑥})
5318intsn 4914 . . . . 5 {𝑥} = 𝑥
5452, 53eqtrdi 2790 . . . 4 (𝐴 = {𝑥} → 𝐴 = 𝑥)
5550, 51, 543eqtr4a 2800 . . 3 (𝐴 = {𝑥} → 𝐴 = 𝐴)
5655exlimiv 1937 . 2 (∃𝑥 𝐴 = {𝑥} → 𝐴 = 𝐴)
5749, 56impbii 210 1 ( 𝐴 = 𝐴 ↔ ∃𝑥 𝐴 = {𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wal 1545   = wceq 1547  wex 1786  wcel 2119  ∃!weu 2572  {cab 2717  wne 2934  Vcvv 3431  cun 3881  cin 3882  wss 3883  c0 4261  {csn 4555  {cpr 4557   cuni 4838   cint 4877
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-sn 4556  df-pr 4558  df-uni 4839  df-int 4878
This theorem is referenced by:  uniintab  4916
  Copyright terms: Public domain W3C validator