HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  dmdbr Structured version   Visualization version   GIF version

Theorem dmdbr 32960
Description: Binary relation expressing the dual modular pair property. (Contributed by NM, 27-Apr-2006.) (New usage is discouraged.)
Assertion
Ref Expression
dmdbr ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ* 𝐵 ↔ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem dmdbr
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2855 . . . . 5 (𝑦 = 𝐴 → (𝑦 ∈ Cℋ ↔ 𝐴 ∈ Cℋ ))
21anbi1d 643 . . . 4 (𝑦 = 𝐴 → ((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ )))
3 ineq2 4113 . . . . . . . 8 (𝑦 = 𝐴 → (𝑥 ∩ 𝑦) = (𝑥 ∩ 𝐴))
43oveq1d 7465 . . . . . . 7 (𝑦 = 𝐴 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = ((𝑥 ∩ 𝐴) ∨ℋ 𝑧))
5 oveq1 7457 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦 ∨ℋ 𝑧) = (𝐴 ∨ℋ 𝑧))
65ineq2d 4119 . . . . . . 7 (𝑦 = 𝐴 → (𝑥 ∩ (𝑦 ∨ℋ 𝑧)) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))
74, 6eqeq12d 2782 . . . . . 6 (𝑦 = 𝐴 → (((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧)) ↔ ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))))
87imbi2d 343 . . . . 5 (𝑦 = 𝐴 → ((𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧))) ↔ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))))
98ralbidv 3192 . . . 4 (𝑦 = 𝐴 → (∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧))) ↔ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))))
102, 9anbi12d 644 . . 3 (𝑦 = 𝐴 → (((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧)))) ↔ ((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))))))
11 eleq1 2855 . . . . 5 (𝑧 = 𝐵 → (𝑧 ∈ Cℋ ↔ 𝐵 ∈ Cℋ ))
1211anbi2d 642 . . . 4 (𝑧 = 𝐵 → ((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ )))
13 sseq1 3937 . . . . . 6 (𝑧 = 𝐵 → (𝑧 ⊆ 𝑥 ↔ 𝐵 ⊆ 𝑥))
14 oveq2 7458 . . . . . . 7 (𝑧 = 𝐵 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = ((𝑥 ∩ 𝐴) ∨ℋ 𝐵))
15 oveq2 7458 . . . . . . . 8 (𝑧 = 𝐵 → (𝐴 ∨ℋ 𝑧) = (𝐴 ∨ℋ 𝐵))
1615ineq2d 4119 . . . . . . 7 (𝑧 = 𝐵 → (𝑥 ∩ (𝐴 ∨ℋ 𝑧)) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))
1714, 16eqeq12d 2782 . . . . . 6 (𝑧 = 𝐵 → (((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)) ↔ ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵))))
1813, 17imbi12d 347 . . . . 5 (𝑧 = 𝐵 → ((𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))) ↔ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))
1918ralbidv 3192 . . . 4 (𝑧 = 𝐵 → (∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧))) ↔ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))
2012, 19anbi12d 644 . . 3 (𝑧 = 𝐵 → (((𝐴 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝑧) = (𝑥 ∩ (𝐴 ∨ℋ 𝑧)))) ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵))))))
21 df-dmd 32942 . . 3 𝑀ℋ* = {⟨𝑦, 𝑧⟩ ∣ ((𝑦 ∈ Cℋ ∧ 𝑧 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝑧 ⊆ 𝑥 → ((𝑥 ∩ 𝑦) ∨ℋ 𝑧) = (𝑥 ∩ (𝑦 ∨ℋ 𝑧))))}
2210, 20, 21brabg 5520 . 2 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ* 𝐵 ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵))))))
2322bianabs 551 1 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ* 𝐵 ↔ ∀𝑥 ∈ Cℋ (𝐵 ⊆ 𝑥 → ((𝑥 ∩ 𝐴) ∨ℋ 𝐵) = (𝑥 ∩ (𝐴 ∨ℋ 𝐵)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ∈ wcel 2150  ∀wral 3083   ⊆ wss 3899   ∩ cin 4091   class class class wbr 5107  (class class class)co 7450   Cℋ cch 31590   ∨ℋ chj 31594   𝑀ℋ* cdmd 31628
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-sep 5254  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-ral 3084  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-iota 6519  df-fv 6573  df-ov 7453  df-dmd 32942
This theorem is used by:  dmdmd  32961  dmdi  32963  dmdbr2  32964  dmdbr3  32966  mddmd2  32970
  Copyright terms: Public domain W3C validator