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

Theorem compsscnvlem 9792
Description: Lemma for compsscnv 9793. (Contributed by Mario Carneiro, 17-May-2015.)
Assertion
Ref Expression
compsscnvlem ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)))
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem compsscnvlem
StepHypRef Expression
1 simpr 487 . . . 4 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → 𝑦 = (𝐴𝑥))
2 difss 4108 . . . 4 (𝐴𝑥) ⊆ 𝐴
31, 2eqsstrdi 4021 . . 3 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → 𝑦𝐴)
4 velpw 4544 . . 3 (𝑦 ∈ 𝒫 𝐴𝑦𝐴)
53, 4sylibr 236 . 2 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → 𝑦 ∈ 𝒫 𝐴)
61difeq2d 4099 . . 3 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝐴𝑦) = (𝐴 ∖ (𝐴𝑥)))
7 elpwi 4548 . . . . 5 (𝑥 ∈ 𝒫 𝐴𝑥𝐴)
87adantr 483 . . . 4 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → 𝑥𝐴)
9 dfss4 4235 . . . 4 (𝑥𝐴 ↔ (𝐴 ∖ (𝐴𝑥)) = 𝑥)
108, 9sylib 220 . . 3 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝐴 ∖ (𝐴𝑥)) = 𝑥)
116, 10eqtr2d 2857 . 2 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → 𝑥 = (𝐴𝑦))
125, 11jca 514 1 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1537  wcel 2114  cdif 3933  wss 3936  𝒫 cpw 4539
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-rab 3147  df-v 3496  df-dif 3939  df-in 3943  df-ss 3952  df-pw 4541
This theorem is referenced by:  compsscnv  9793
  Copyright terms: Public domain W3C validator