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

Theorem compsscnv 10279
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 6092 . 2 {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
2 compss.a . . . 4 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥))
3 difeq2 4070 . . . . 5 (𝑥 = 𝑦 → (𝐴𝑥) = (𝐴𝑦))
43cbvmptv 5200 . . . 4 (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥)) = (𝑦 ∈ 𝒫 𝐴 ↦ (𝐴𝑦))
5 df-mpt 5178 . . . 4 (𝑦 ∈ 𝒫 𝐴 ↦ (𝐴𝑦)) = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
62, 4, 53eqtri 2761 . . 3 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
76cnveqi 5821 . 2 𝐹 = {⟨𝑦, 𝑥⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
8 df-mpt 5178 . . 3 (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥))}
9 compsscnvlem 10278 . . . . 5 ((𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)) → (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)))
10 compsscnvlem 10278 . . . . 5 ((𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)) → (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)))
119, 10impbii 209 . . . 4 ((𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦)) ↔ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥)))
1211opabbii 5163 . . 3 {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝒫 𝐴𝑦 = (𝐴𝑥))}
138, 2, 123eqtr4i 2767 . 2 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑦 ∈ 𝒫 𝐴𝑥 = (𝐴𝑦))}
141, 7, 133eqtr4i 2767 1 𝐹 = 𝐹
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1541  wcel 2113  cdif 3896  𝒫 cpw 4552  {copab 5158  cmpt 5177  ccnv 5621
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-11 2162  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-clel 2809  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-br 5097  df-opab 5159  df-mpt 5178  df-xp 5628  df-rel 5629  df-cnv 5630
This theorem is referenced by:  compssiso  10282  isf34lem3  10283  compss  10284  isf34lem5  10286
  Copyright terms: Public domain W3C validator