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

Theorem intidOLD 5454
Description: Obsolete version of intidg 5453 as of 18-Jan-2025. (Contributed by NM, 5-Jun-2009.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
intid.1 𝐴 ∈ V
Assertion
Ref Expression
intidOLD {𝑥𝐴𝑥} = {𝐴}
Distinct variable group:   𝑥,𝐴

Proof of Theorem intidOLD
StepHypRef Expression
1 snex 5427 . . 3 {𝐴} ∈ V
2 eleq2 2817 . . . 4 (𝑥 = {𝐴} → (𝐴𝑥𝐴 ∈ {𝐴}))
3 intid.1 . . . . 5 𝐴 ∈ V
43snid 4660 . . . 4 𝐴 ∈ {𝐴}
52, 4intmin3 4974 . . 3 ({𝐴} ∈ V → {𝑥𝐴𝑥} ⊆ {𝐴})
61, 5ax-mp 5 . 2 {𝑥𝐴𝑥} ⊆ {𝐴}
73elintab 4956 . . . 4 (𝐴 {𝑥𝐴𝑥} ↔ ∀𝑥(𝐴𝑥𝐴𝑥))
8 id 22 . . . 4 (𝐴𝑥𝐴𝑥)
97, 8mpgbir 1794 . . 3 𝐴 {𝑥𝐴𝑥}
10 snssi 4807 . . 3 (𝐴 {𝑥𝐴𝑥} → {𝐴} ⊆ {𝑥𝐴𝑥})
119, 10ax-mp 5 . 2 {𝐴} ⊆ {𝑥𝐴𝑥}
126, 11eqssi 3994 1 {𝑥𝐴𝑥} = {𝐴}
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1534  wcel 2099  {cab 2704  Vcvv 3469  wss 3944  {csn 4624   cint 4944
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-ral 3057  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-sn 4625  df-pr 4627  df-int 4945
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator