Metamath Proof Explorer


Theorem mdbr

Description: Binary relation expressing <. A , B >. is a modular pair. Definition 1.1 of MaedaMaeda p. 1. (Contributed by NM, 14-Jun-2004) (New usage is discouraged.)

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

Proof

Step Hyp Ref Expression
1 eleq1 ⊢ y = A → y ∈ C ℋ ↔ A ∈ C ℋ
2 1 anbi1d ⊢ y = A → y ∈ C ℋ ∧ z ∈ C ℋ ↔ A ∈ C ℋ ∧ z ∈ C ℋ
3 oveq2 ⊢ y = A → x ∨ ℋ y = x ∨ ℋ A
4 3 ineq1d ⊢ y = A → x ∨ ℋ y ∩ z = x ∨ ℋ A ∩ z
5 ineq1 ⊢ y = A → y ∩ z = A ∩ z
6 5 oveq2d ⊢ y = A → x ∨ ℋ y ∩ z = x ∨ ℋ A ∩ z
7 4 6 eqeq12d ⊢ y = A → x ∨ ℋ y ∩ z = x ∨ ℋ y ∩ z ↔ x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z
8 7 imbi2d ⊢ y = A → x ⊆ z → x ∨ ℋ y ∩ z = x ∨ ℋ y ∩ z ↔ x ⊆ z → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z
9 8 ralbidv ⊢ y = A → ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ y ∩ z = x ∨ ℋ y ∩ z ↔ ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z
10 2 9 anbi12d ⊢ y = A → y ∈ C ℋ ∧ z ∈ C ℋ ∧ ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ y ∩ z = x ∨ ℋ y ∩ z ↔ A ∈ C ℋ ∧ z ∈ C ℋ ∧ ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z
11 eleq1 ⊢ z = B → z ∈ C ℋ ↔ B ∈ C ℋ
12 11 anbi2d ⊢ z = B → A ∈ C ℋ ∧ z ∈ C ℋ ↔ A ∈ C ℋ ∧ B ∈ C ℋ
13 sseq2 ⊢ z = B → x ⊆ z ↔ x ⊆ B
14 ineq2 ⊢ z = B → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ B
15 ineq2 ⊢ z = B → A ∩ z = A ∩ B
16 15 oveq2d ⊢ z = B → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ B
17 14 16 eqeq12d ⊢ z = B → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z ↔ x ∨ ℋ A ∩ B = x ∨ ℋ A ∩ B
18 13 17 imbi12d ⊢ z = B → x ⊆ z → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z ↔ x ⊆ B → x ∨ ℋ A ∩ B = x ∨ ℋ A ∩ B
19 18 ralbidv ⊢ z = B → ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z ↔ ∀ x ∈ C ℋ x ⊆ B → x ∨ ℋ A ∩ B = x ∨ ℋ A ∩ B
20 12 19 anbi12d ⊢ z = B → A ∈ C ℋ ∧ z ∈ C ℋ ∧ ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ A ∩ z = x ∨ ℋ A ∩ z ↔ A ∈ C ℋ ∧ B ∈ C ℋ ∧ ∀ x ∈ C ℋ x ⊆ B → x ∨ ℋ A ∩ B = x ∨ ℋ A ∩ B
21 df-md ⊢ 𝑀 ℋ = y z | y ∈ C ℋ ∧ z ∈ C ℋ ∧ ∀ x ∈ C ℋ x ⊆ z → x ∨ ℋ y ∩ z = x ∨ ℋ y ∩ z
22 10 20 21 brabg ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A 𝑀 ℋ B ↔ A ∈ C ℋ ∧ B ∈ C ℋ ∧ ∀ x ∈ C ℋ x ⊆ B → x ∨ ℋ A ∩ B = x ∨ ℋ A ∩ B
23 22 bianabs ⊢ A ∈ C ℋ ∧ B ∈ C ℋ → A 𝑀 ℋ B ↔ ∀ x ∈ C ℋ x ⊆ B → x ∨ ℋ A ∩ B = x ∨ ℋ A ∩ B