Theorem compssiso 10310

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 5284	. . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∖ 𝑥) ∈ V)
2	1	ralrimivw 3147	. . . 4 ⊢ (𝐴 ∈ 𝑉 → ∀𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ V)
3		compss.a	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝒫 𝐴 ↦ (𝐴 ∖ 𝑥))
4	3	fnmpt 6641	. . . 4 ⊢ (∀𝑥 ∈ 𝒫 𝐴(𝐴 ∖ 𝑥) ∈ V → 𝐹 Fn 𝒫 𝐴)
5	2, 4	syl 17	. . 3 ⊢ (𝐴 ∈ 𝑉 → 𝐹 Fn 𝒫 𝐴)
6	3	compsscnv 10307	. . . . 5 ⊢ ◡𝐹 = 𝐹
7	6	fneq1i 6599	. . . 4 ⊢ (◡𝐹 Fn 𝒫 𝐴 ↔ 𝐹 Fn 𝒫 𝐴)
8	5, 7	sylibr 233	. . 3 ⊢ (𝐴 ∈ 𝑉 → ◡𝐹 Fn 𝒫 𝐴)
9		dff1o4 6792	. . 3 ⊢ (𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴 ↔ (𝐹 Fn 𝒫 𝐴 ∧ ◡𝐹 Fn 𝒫 𝐴))
10	5, 8, 9	sylanbrc 583	. 2 ⊢ (𝐴 ∈ 𝑉 → 𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴)
11		elpwi 4567	. . . . . . . . 9 ⊢ (𝑏 ∈ 𝒫 𝐴 → 𝑏 ⊆ 𝐴)
12	11	ad2antll 727	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → 𝑏 ⊆ 𝐴)
13	3	isf34lem1 10308	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑏 ⊆ 𝐴) → (𝐹‘𝑏) = (𝐴 ∖ 𝑏))
14	12, 13	syldan 591	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐹‘𝑏) = (𝐴 ∖ 𝑏))
15		elpwi 4567	. . . . . . . . 9 ⊢ (𝑎 ∈ 𝒫 𝐴 → 𝑎 ⊆ 𝐴)
16	15	ad2antrl 726	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → 𝑎 ⊆ 𝐴)
17	3	isf34lem1 10308	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑎 ⊆ 𝐴) → (𝐹‘𝑎) = (𝐴 ∖ 𝑎))
18	16, 17	syldan 591	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐹‘𝑎) = (𝐴 ∖ 𝑎))
19	14, 18	psseq12d 4054	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐹‘𝑏) ⊊ (𝐹‘𝑎) ↔ (𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎)))
20		difss 4091	. . . . . . 7 ⊢ (𝐴 ∖ 𝑎) ⊆ 𝐴
21		pssdifcom1 4447	. . . . . . 7 ⊢ ((𝑏 ⊆ 𝐴 ∧ (𝐴 ∖ 𝑎) ⊆ 𝐴) → ((𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎) ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏))
22	12, 20, 21	sylancl 586	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐴 ∖ 𝑏) ⊊ (𝐴 ∖ 𝑎) ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏))
23		dfss4 4218	. . . . . . . 8 ⊢ (𝑎 ⊆ 𝐴 ↔ (𝐴 ∖ (𝐴 ∖ 𝑎)) = 𝑎)
24	16, 23	sylib 217	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝐴 ∖ (𝐴 ∖ 𝑎)) = 𝑎)
25	24	psseq1d 4052	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → ((𝐴 ∖ (𝐴 ∖ 𝑎)) ⊊ 𝑏 ↔ 𝑎 ⊊ 𝑏))
26	19, 22, 25	3bitrrd 305	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 ⊊ 𝑏 ↔ (𝐹‘𝑏) ⊊ (𝐹‘𝑎)))
27		vex 3449	. . . . . 6 ⊢ 𝑏 ∈ V
28	27	brrpss 7663	. . . . 5 ⊢ (𝑎 [⊊] 𝑏 ↔ 𝑎 ⊊ 𝑏)
29		fvex 6855	. . . . . 6 ⊢ (𝐹‘𝑎) ∈ V
30	29	brrpss 7663	. . . . 5 ⊢ ((𝐹‘𝑏) [⊊] (𝐹‘𝑎) ↔ (𝐹‘𝑏) ⊊ (𝐹‘𝑎))
31	26, 28, 30	3bitr4g 313	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑏) [⊊] (𝐹‘𝑎)))
32		relrpss 7661	. . . . 5 ⊢ Rel [⊊]
33	32	relbrcnv 6059	. . . 4 ⊢ ((𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏) ↔ (𝐹‘𝑏) [⊊] (𝐹‘𝑎))
34	31, 33	bitr4di 288	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ (𝑎 ∈ 𝒫 𝐴 ∧ 𝑏 ∈ 𝒫 𝐴)) → (𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏)))
35	34	ralrimivva 3197	. 2 ⊢ (𝐴 ∈ 𝑉 → ∀𝑎 ∈ 𝒫 𝐴∀𝑏 ∈ 𝒫 𝐴(𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏)))
36		df-isom 6505	. 2 ⊢ (𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴) ↔ (𝐹:𝒫 𝐴–1-1-onto→𝒫 𝐴 ∧ ∀𝑎 ∈ 𝒫 𝐴∀𝑏 ∈ 𝒫 𝐴(𝑎 [⊊] 𝑏 ↔ (𝐹‘𝑎)◡ [⊊] (𝐹‘𝑏))))
37	10, 35, 36	sylanbrc 583	1 ⊢ (𝐴 ∈ 𝑉 → 𝐹 Isom [⊊] , ◡ [⊊] (𝒫 𝐴, 𝒫 𝐴))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1541   ∈ wcel 2106  ∀wral 3064  Vcvv 3445   ∖ cdif 3907   ⊆ wss 3910   ⊊ wpss 3911  𝒫 cpw 4560   class class class wbr 5105   ↦ cmpt 5188  ^◡ccnv 5632   Fn wfn 6491  –1-1-onto→wf1o 6495  ‘cfv 6496   Isom wiso 6497   [⊊] crpss 7659

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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-sep 5256  ax-nul 5263  ax-pr 5384

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-rab 3408  df-v 3447  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-isom 6505  df-rpss 7660

This theorem is referenced by:  isf34lem3  10311  isf34lem5  10314  isfin1-4  10323