Metamath Proof Explorer


Theorem ssmd2

Description: Ordering implies the modular pair property. Remark in MaedaMaeda p. 1. (Contributed by NM, 21-Jun-2004) (New usage is discouraged.)

Ref Expression
Assertion ssmd2 ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ A ⊆ B → B 𝑀 ℋ A

Proof

Step Hyp Ref Expression
1 inss2 ⊢ x ∨ ℋ B ∩ A ⊆ A
2 chub2 ⊢ A ∈ C ℋ ∧ x ∈ C ℋ → A ⊆ x ∨ ℋ A
3 1 2 sstrid ⊢ A ∈ C ℋ ∧ x ∈ C ℋ → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ A
4 3 adantrl ⊢ A ∈ C ℋ ∧ A ⊆ B ∧ x ∈ C ℋ → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ A
5 sseqin2 ⊢ A ⊆ B ↔ B ∩ A = A
6 5 birani ⊢ A ⊆ B ∧ x ∈ C ℋ → B ∩ A = A
7 6 adantl ⊢ A ∈ C ℋ ∧ A ⊆ B ∧ x ∈ C ℋ → B ∩ A = A
8 7 oveq2d ⊢ A ∈ C ℋ ∧ A ⊆ B ∧ x ∈ C ℋ → x ∨ ℋ B ∩ A = x ∨ ℋ A
9 4 8 sseqtrrd ⊢ A ∈ C ℋ ∧ A ⊆ B ∧ x ∈ C ℋ → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
10 9 a1d ⊢ A ∈ C ℋ ∧ A ⊆ B ∧ x ∈ C ℋ → x ⊆ A → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
11 10 exp32 ⊢ A ∈ C ℋ → A ⊆ B → x ∈ C ℋ → x ⊆ A → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
12 11 ralrimdv ⊢ A ∈ C ℋ → A ⊆ B → ∀ x ∈ C ℋ x ⊆ A → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
13 12 adantr ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A ⊆ B → ∀ x ∈ C ℋ x ⊆ A → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
14 mdbr2 ⊢ B ∈ C ℋ ∧ A ∈ C ℋ → B 𝑀 ℋ A ↔ ∀ x ∈ C ℋ x ⊆ A → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
15 14 ancoms ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → B 𝑀 ℋ A ↔ ∀ x ∈ C ℋ x ⊆ A → x ∨ ℋ B ∩ A ⊆ x ∨ ℋ B ∩ A
16 13 15 sylibrd ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A ⊆ B → B 𝑀 ℋ A
17 16 3impia ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ A ⊆ B → B 𝑀 ℋ A