Theorem compssiso 9785

Description: Complementation is an antiautomorphism on power set lattices. (Contributed by Stefan O'Rear, 4-Nov-2014.) (Proof shortened by Mario Carneiro, 17-May-2015.)

Hypothesis

Ref	Expression
compss.a	⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))

Assertion

Ref	Expression
compssiso	⊢ (𝐴 ∈ 𝑉 → 𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴))

Distinct variable groups:   𝑥,𝐴   𝑥,𝑉

Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem compssiso

Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		difexg 5195	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ 𝑥) ∈ V)
2	1	ralrimivw 3150	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ V)
3		compss.a	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))
4	3	fnmpt 6460	. . . 4 ⊢ (∀𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ V → 𝐹 Fn 𝒫 𝐴)
5	2, 4	syl 17	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐹 Fn 𝒫 𝐴)
6	3	compsscnv 9782	. . . . 5 ⊢ ◡𝐹 = 𝐹
7	6	fneq1i 6420	. . . 4 ⊢ (◡𝐹 Fn 𝒫 𝐴 ↔ 𝐹 Fn 𝒫 𝐴)
8	5, 7	sylibr 237	. . 3 ⊢ (𝐴 ∈ 𝑉 → ◡𝐹 Fn 𝒫 𝐴)
9		dff1o4 6598	. . 3 ⊢ (𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴 ↔ (𝐹 Fn 𝒫 𝐴 ∧ ◡𝐹 Fn 𝒫 𝐴))
10	5, 8, 9	sylanbrc 586	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴)
11		elpwi 4506	. . . . . . . . 9 ⊢ (𝑏 ∈ 𝒫 𝐴 → 𝑏 ⊆ 𝐴)
12	11	ad2antll 728	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → 𝑏 ⊆ 𝐴)
13	3	isf34lem1 9783	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑏 ⊆ 𝐴) → (𝐹‘𝑏) = (𝐴 ∖ 𝑏))
14	12, 13	syldan 594	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐹‘𝑏) = (𝐴 ∖ 𝑏))
15		elpwi 4506	. . . . . . . . 9 ⊢ (𝑎 ∈ 𝒫 𝐴 → 𝑎 ⊆ 𝐴)
16	15	ad2antrl 727	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → 𝑎 ⊆ 𝐴)
17	3	isf34lem1 9783	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ⊆ 𝐴) → (𝐹‘𝑎) = (𝐴 ∖ 𝑎))
18	16, 17	syldan 594	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐹‘𝑎) = (𝐴 ∖ 𝑎))
19	14, 18	psseq12d 4022	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐹‘𝑏) ⊊ (𝐹‘𝑎) ↔ (𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎)))
20		difss 4059	. . . . . . 7 ⊢ (𝐴 ∖ 𝑎) ⊆ 𝐴
21		pssdifcom1 4393	. . . . . . 7 ⊢ ((𝑏 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑎) ⊆ 𝐴) → ((𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎) ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏))
22	12, 20, 21	sylancl 589	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎) ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏))
23		dfss4 4185	. . . . . . . 8 ⊢ (𝑎 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) = 𝑎)
24	16, 23	sylib 221	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐴 ∖ (𝐴 ∖ 𝑎)) = 𝑎)
25	24	psseq1d 4020	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏 ↔ 𝑎 ⊊ 𝑏))
26	19, 22, 25	3bitrrd 309	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 ⊊ 𝑏 ↔ (𝐹‘𝑏) ⊊ (𝐹‘𝑎)))
27		vex 3444	. . . . . 6 ⊢ 𝑏 ∈ V
28	27	brrpss 7432	. . . . 5 ⊢ (𝑎 [⊊] 𝑏 ↔ 𝑎 ⊊ 𝑏)
29		fvex 6658	. . . . . 6 ⊢ (𝐹‘𝑎) ∈ V
30	29	brrpss 7432	. . . . 5 ⊢ ((𝐹‘𝑏) [⊊] (𝐹‘𝑎) ↔ (𝐹‘𝑏) ⊊ (𝐹‘𝑎))
31	26, 28, 30	3bitr4g 317	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑏) [⊊] (𝐹‘𝑎)))
32		relrpss 7430	. . . . 5 ⊢ Rel [⊊]
33	32	relbrcnv 5937	. . . 4 ⊢ ((𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏) ↔ (𝐹‘𝑏) [⊊] (𝐹‘𝑎))
34	31, 33	syl6bbr 292	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏)))
35	34	ralrimivva 3156	. 2 ⊢ (𝐴 ∈ 𝑉 → ∀𝑎 ∈ 𝒫 𝐴∀𝑏 ∈ 𝒫 𝐴(𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏)))
36		df-isom 6333	. 2 ⊢ (𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴) ↔ (𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴 ∧ ∀𝑎 ∈ 𝒫 𝐴∀𝑏 ∈ 𝒫 𝐴(𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏))))
37	10, 35, 36	sylanbrc 586	1 ⊢ (𝐴 ∈ 𝑉 → 𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1538   ∈ wcel 2111  ∀wral 3106  Vcvv 3441   ∖ cdif 3878   ⊆ wss 3881   ⊊ wpss 3882  𝒫 cpw 4497   class class class wbr 5030   ↦ cmpt 5110  ^◡ccnv 5518   Fn wfn 6319  –1-1-onto→wf1o 6323  ‘cfv 6324   Isom wiso 6325   [⊊] crpss 7428

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pr 5295

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2598  df-eu 2629  df-clab 2777  df-cleq 2791  df-clel 2870  df-nfc 2938  df-ne 2988  df-ral 3111  df-rex 3112  df-rab 3115  df-v 3443  df-sbc 3721  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-pss 3900  df-nul 4244  df-if 4426  df-pw 4499  df-sn 4526  df-pr 4528  df-op 4532  df-uni 4801  df-br 5031  df-opab 5093  df-mpt 5111  df-id 5425  df-xp 5525  df-rel 5526  df-cnv 5527  df-co 5528  df-dm 5529  df-rn 5530  df-iota 6283  df-fun 6326  df-fn 6327  df-f 6328  df-f1 6329  df-fo 6330  df-f1o 6331  df-fv 6332  df-isom 6333  df-rpss 7429

This theorem is referenced by:  isf34lem3  9786  isf34lem5  9789  isfin1-4  9798