Metamath Proof Explorer


Theorem dmdbr2

Description: Binary relation expressing the dual modular pair property. This version has a weaker constraint than dmdbr . (Contributed by NM, 30-Jun-2004) (New usage is discouraged.)

Ref Expression
Assertion dmdbr2 ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A 𝑀 ℋ * B ↔ ∀ x ∈ C ℋ B ⊆ x → x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B

Proof

Step Hyp Ref Expression
1 dmdbr ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A 𝑀 ℋ * B ↔ ∀ x ∈ C ℋ B ⊆ x → x ∩ A ∨ ℋ B = x ∩ A ∨ ℋ B
2 chincl ⊢ x ∈ C ℋ ∧ A ∈ C ℋ → x ∩ A ∈ C ℋ
3 2 ancoms ⊢ A ∈ C ℋ ∧ x ∈ C ℋ → x ∩ A ∈ C ℋ
4 3 adantlr ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → x ∩ A ∈ C ℋ
5 simplr ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ∈ C ℋ
6 simpr ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → x ∈ C ℋ
7 inss1 ⊢ x ∩ A ⊆ x
8 chlub ⊢ x ∩ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → x ∩ A ⊆ x ∧ B ⊆ x ↔ x ∩ A ∨ ℋ B ⊆ x
9 8 biimpd ⊢ x ∩ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → x ∩ A ⊆ x ∧ B ⊆ x → x ∩ A ∨ ℋ B ⊆ x
10 7 9 mpani ⊢ x ∩ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ⊆ x → x ∩ A ∨ ℋ B ⊆ x
11 4 5 6 10 syl3anc ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ⊆ x → x ∩ A ∨ ℋ B ⊆ x
12 simpll ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → A ∈ C ℋ
13 inss2 ⊢ x ∩ A ⊆ A
14 chlej1 ⊢ x ∩ A ∈ C ℋ ∧ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∩ A ⊆ A → x ∩ A ∨ ℋ B ⊆ A ∨ ℋ B
15 13 14 mpan2 ⊢ x ∩ A ∈ C ℋ ∧ A ∈ C ℋ ∧ B ∈ C ℋ → x ∩ A ∨ ℋ B ⊆ A ∨ ℋ B
16 4 12 5 15 syl3anc ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → x ∩ A ∨ ℋ B ⊆ A ∨ ℋ B
17 11 16 jctird ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ⊆ x → x ∩ A ∨ ℋ B ⊆ x ∧ x ∩ A ∨ ℋ B ⊆ A ∨ ℋ B
18 ssin ⊢ x ∩ A ∨ ℋ B ⊆ x ∧ x ∩ A ∨ ℋ B ⊆ A ∨ ℋ B ↔ x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
19 17 18 imbitrdi ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ⊆ x → x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
20 eqss ⊢ x ∩ A ∨ ℋ B = x ∩ A ∨ ℋ B ↔ x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B ∧ x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
21 20 baib ⊢ x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B → x ∩ A ∨ ℋ B = x ∩ A ∨ ℋ B ↔ x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
22 19 21 syl6 ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ⊆ x → x ∩ A ∨ ℋ B = x ∩ A ∨ ℋ B ↔ x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
23 22 pm5.74d ⊢ A ∈ C ℋ ∧ B ∈ C ℋ ∧ x ∈ C ℋ → B ⊆ x → x ∩ A ∨ ℋ B = x ∩ A ∨ ℋ B ↔ B ⊆ x → x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
24 23 ralbidva ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → ∀ x ∈ C ℋ B ⊆ x → x ∩ A ∨ ℋ B = x ∩ A ∨ ℋ B ↔ ∀ x ∈ C ℋ B ⊆ x → x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B
25 1 24 bitrd ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A 𝑀 ℋ * B ↔ ∀ x ∈ C ℋ B ⊆ x → x ∩ A ∨ ℋ B ⊆ x ∩ A ∨ ℋ B