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

Theorem compsscnv 10197
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 6062 . 2 {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
2 compss.a . . . 4 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥))
3 difeq2 4061 . . . . 5 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
43cbvmptv 5198 . . . 4 (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥)) = (𝑦 ∈ 𝒫 𝐴 ↦ (𝐴𝑦))
5 df-mpt 5169 . . . 4 (𝑦 ∈ 𝒫 𝐴 ↦ (𝐴𝑦)) = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
62, 4, 53eqtri 2769 . . 3 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
76cnveqi 5801 . 2 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
8 df-mpt 5169 . . 3 (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥))}
9 compsscnvlem 10196 . . . . 5 ((𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)) → (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)))
10 compsscnvlem 10196 . . . . 5 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)))
119, 10impbii 208 . . . 4 ((𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)) ↔ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)))
1211opabbii 5152 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥))}
138, 2, 123eqtr4i 2775 . 2 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
141, 7, 133eqtr4i 2775 1 𝐹 = 𝐹
Colors of variables: wff setvar class
Syntax hints:  wa 396   = wceq 1540  wcel 2105  cdif 3893  𝒫 cpw 4543  {copab 5147  cmpt 5168  ccnv 5604
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-sep 5236  ax-nul 5243  ax-pr 5365
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-clab 2715  df-cleq 2729  df-clel 2815  df-rab 3405  df-v 3443  df-dif 3899  df-un 3901  df-in 3903  df-ss 3913  df-nul 4267  df-if 4470  df-pw 4545  df-sn 4570  df-pr 4572  df-op 4576  df-br 5086  df-opab 5148  df-mpt 5169  df-xp 5611  df-rel 5612  df-cnv 5613
This theorem is referenced by:  compssiso  10200  isf34lem3  10201  compss  10202  isf34lem5  10204
  Copyright terms: Public domain W3C validator