Theorem compssiso 10324

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 5282	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ 𝑥) ∈ V)
2	1	ralrimivw 3157	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ V)
3		compss.a	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))
4	3	fnmpt 6655	. . . 4 ⊢ (∀𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ V → 𝐹 Fn 𝒫 𝐴)
5	2, 4	syl 17	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐹 Fn 𝒫 𝐴)
6	3	compsscnv 10321	. . . . 5 ⊢ ◡𝐹 = 𝐹
7	6	fneq1i 6612	. . . 4 ⊢ (◡𝐹 Fn 𝒫 𝐴 ↔ 𝐹 Fn 𝒫 𝐴)
8	5, 7	sylibr 236	. . 3 ⊢ (𝐴 ∈ 𝑉 → ◡𝐹 Fn 𝒫 𝐴)
9		dff1o4 6809	. . 3 ⊢ (𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴 ↔ (𝐹 Fn 𝒫 𝐴 ∧ ◡𝐹 Fn 𝒫 𝐴))
10	5, 8, 9	sylanbrc 592	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴)
11		elpwi 4559	. . . . . . . . 9 ⊢ (𝑏 ∈ 𝒫 𝐴 → 𝑏 ⊆ 𝐴)
12	11	ad2antll 739	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → 𝑏 ⊆ 𝐴)
13	3	isf34lem1 10322	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑏 ⊆ 𝐴) → (𝐹‘𝑏) = (𝐴 ∖ 𝑏))
14	12, 13	syldan 600	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐹‘𝑏) = (𝐴 ∖ 𝑏))
15		elpwi 4559	. . . . . . . . 9 ⊢ (𝑎 ∈ 𝒫 𝐴 → 𝑎 ⊆ 𝐴)
16	15	ad2antrl 738	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → 𝑎 ⊆ 𝐴)
17	3	isf34lem1 10322	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ⊆ 𝐴) → (𝐹‘𝑎) = (𝐴 ∖ 𝑎))
18	16, 17	syldan 600	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐹‘𝑎) = (𝐴 ∖ 𝑎))
19	14, 18	psseq12d 4048	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐹‘𝑏) ⊊ (𝐹‘𝑎) ↔ (𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎)))
20		difss 4087	. . . . . . 7 ⊢ (𝐴 ∖ 𝑎) ⊆ 𝐴
21		pssdifcom1 4440	. . . . . . 7 ⊢ ((𝑏 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑎) ⊆ 𝐴) → ((𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎) ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏))
22	12, 20, 21	sylancl 595	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎) ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏))
23		dfss4 4219	. . . . . . . 8 ⊢ (𝑎 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) = 𝑎)
24	16, 23	sylib 220	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐴 ∖ (𝐴 ∖ 𝑎)) = 𝑎)
25	24	psseq1d 4046	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏 ↔ 𝑎 ⊊ 𝑏))
26	19, 22, 25	3bitrrd 308	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 ⊊ 𝑏 ↔ (𝐹‘𝑏) ⊊ (𝐹‘𝑎)))
27		vex 3457	. . . . . 6 ⊢ 𝑏 ∈ V
28	27	brrpss 7703	. . . . 5 ⊢ (𝑎 [⊊] 𝑏 ↔ 𝑎 ⊊ 𝑏)
29		fvex 6874	. . . . . 6 ⊢ (𝐹‘𝑎) ∈ V
30	29	brrpss 7703	. . . . 5 ⊢ ((𝐹‘𝑏) [⊊] (𝐹‘𝑎) ↔ (𝐹‘𝑏) ⊊ (𝐹‘𝑎))
31	26, 28, 30	3bitr4g 316	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑏) [⊊] (𝐹‘𝑎)))
32		relrpss 7701	. . . . 5 ⊢ Rel [⊊]
33	32	relbrcnv 6091	. . . 4 ⊢ ((𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏) ↔ (𝐹‘𝑏) [⊊] (𝐹‘𝑎))
34	31, 33	bitr4di 291	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏)))
35	34	ralrimivva 3204	. 2 ⊢ (𝐴 ∈ 𝑉 → ∀𝑎 ∈ 𝒫 𝐴∀𝑏 ∈ 𝒫 𝐴(𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏)))
36		df-isom 6524	. 2 ⊢ (𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴) ↔ (𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴 ∧ ∀𝑎 ∈ 𝒫 𝐴∀𝑏 ∈ 𝒫 𝐴(𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏))))
37	10, 35, 36	sylanbrc 592	1 ⊢ (𝐴 ∈ 𝑉 → 𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 399   = wceq 1559   ∈ wcel 2141  ∀wral 3075  Vcvv 3453   ∖ cdif 3899   ⊆ wss 3902   ⊊ wpss 3903  𝒫 cpw 4552   class class class wbr 5097   ↦ cmpt 5178  ^◡ccnv 5642   Fn wfn 6510  –1-1-onto→wf1o 6514  ‘cfv 6515   Isom wiso 6516   [⊊] crpss 7699

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-isom 6524  df-rpss 7700

This theorem is referenced by:  isf34lem3  10325  isf34lem5  10328  isfin1-4  10337