Metamath Proof Explorer


Theorem chpsscon3

Description: Hilbert lattice contraposition law for strict ordering. (Contributed by NM, 12-Jun-2004) (New usage is discouraged.)

Ref Expression
Assertion chpsscon3 ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A ⊂ B ↔ ⊥ ⁡ B ⊂ ⊥ ⁡ A

Proof

Step Hyp Ref Expression
1 chsscon3 ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A ⊆ B ↔ ⊥ ⁡ B ⊆ ⊥ ⁡ A
2 chsscon3 ⊢ B ∈ C ℋ ∧ A ∈ C ℋ → B ⊆ A ↔ ⊥ ⁡ A ⊆ ⊥ ⁡ B
3 2 ancoms ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → B ⊆ A ↔ ⊥ ⁡ A ⊆ ⊥ ⁡ B
4 3 notbid ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → ¬ B ⊆ A ↔ ¬ ⊥ ⁡ A ⊆ ⊥ ⁡ B
5 1 4 anbi12d ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A ⊆ B ∧ ¬ B ⊆ A ↔ ⊥ ⁡ B ⊆ ⊥ ⁡ A ∧ ¬ ⊥ ⁡ A ⊆ ⊥ ⁡ B
6 dfpss3 ⊢ A ⊂ B ↔ A ⊆ B ∧ ¬ B ⊆ A
7 dfpss3 ⊢ ⊥ ⁡ B ⊂ ⊥ ⁡ A ↔ ⊥ ⁡ B ⊆ ⊥ ⁡ A ∧ ¬ ⊥ ⁡ A ⊆ ⊥ ⁡ B
8 5 6 7 3bitr4g ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A ⊂ B ↔ ⊥ ⁡ B ⊂ ⊥ ⁡ A