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

Theorem pweqALT 4571
Description: Alternate proof of pweq 4570 directly from the definition. (Contributed by NM, 21-Jun-1993.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
pweqALT (𝐴 = 𝐵 → 𝒫 𝐴 = 𝒫 𝐵)

Proof of Theorem pweqALT
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 sseq2 3934 . . 3 (𝐴 = 𝐵 → (𝑥 ⊆ 𝐴 ↔ 𝑥 ⊆ 𝐵))
21abbidv 2826 . 2 (𝐴 = 𝐵 → {𝑥 ∣ 𝑥 ⊆ 𝐴} = {𝑥 ∣ 𝑥 ⊆ 𝐵})
3 df-pw 4558 . 2 𝒫 𝐴 = {𝑥 ∣ 𝑥 ⊆ 𝐴}
4 df-pw 4558 . 2 𝒫 𝐵 = {𝑥 ∣ 𝑥 ⊆ 𝐵}
52, 3, 43eqtr4g 2820 1 (𝐴 = 𝐵 → 𝒫 𝐴 = 𝒫 𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1569  {cab 2738   ⊆ wss 3895  𝒫 cpw 4556
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-ss 3896  df-pw 4558
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator