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

Theorem compsscnv 10440
Description: Complementation on a power set lattice is an involution. (Contributed by Mario Carneiro, 17-May-2015.)
Hypothesis
Ref Expression
compss.a 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥))
Assertion
Ref Expression
compsscnv 𝐹 = 𝐹
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem compsscnv
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 cnvopab 6169 . 2 {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
2 compss.a . . . 4 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥))
3 difeq2 4143 . . . . 5 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
43cbvmptv 5279 . . . 4 (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥)) = (𝑦 ∈ 𝒫 𝐴 ↦ (𝐴𝑦))
5 df-mpt 5250 . . . 4 (𝑦 ∈ 𝒫 𝐴 ↦ (𝐴𝑦)) = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
62, 4, 53eqtri 2772 . . 3 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
76cnveqi 5899 . 2 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
8 df-mpt 5250 . . 3 (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥))}
9 compsscnvlem 10439 . . . . 5 ((𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)) → (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)))
10 compsscnvlem 10439 . . . . 5 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)))
119, 10impbii 209 . . . 4 ((𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)) ↔ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)))
1211opabbii 5233 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥))}
138, 2, 123eqtr4i 2778 . 2 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
141, 7, 133eqtr4i 2778 1 𝐹 = 𝐹
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1537  wcel 2108  cdif 3973  𝒫 cpw 4622  {copab 5228  cmpt 5249  ccnv 5699
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-11 2158  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-sb 2065  df-clab 2718  df-cleq 2732  df-clel 2819  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-br 5167  df-opab 5229  df-mpt 5250  df-xp 5706  df-rel 5707  df-cnv 5708
This theorem is referenced by:  compssiso  10443  isf34lem3  10444  compss  10445  isf34lem5  10447
  Copyright terms: Public domain W3C validator