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

Theorem dmdbr 32392
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 2829 . . . . 5 (𝑦 = 𝐴 → (𝑦C𝐴C ))
21anbi1d 638 . . . 4 (𝑦 = 𝐴 → ((𝑦C𝑧C ) ↔ (𝐴C𝑧C )))
3 ineq2 4146 . . . . . . . 8 (𝑦 = 𝐴 → (𝑥𝑦) = (𝑥𝐴))
43oveq1d 7375 . . . . . . 7 (𝑦 = 𝐴 → ((𝑥𝑦) ∨ 𝑧) = ((𝑥𝐴) ∨ 𝑧))
5 oveq1 7367 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦 𝑧) = (𝐴 𝑧))
65ineq2d 4152 . . . . . . 7 (𝑦 = 𝐴 → (𝑥 ∩ (𝑦 𝑧)) = (𝑥 ∩ (𝐴 𝑧)))
74, 6eqeq12d 2757 . . . . . 6 (𝑦 = 𝐴 → (((𝑥𝑦) ∨ 𝑧) = (𝑥 ∩ (𝑦 𝑧)) ↔ ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧))))
87imbi2d 342 . . . . 5 (𝑦 = 𝐴 → ((𝑧𝑥 → ((𝑥𝑦) ∨ 𝑧) = (𝑥 ∩ (𝑦 𝑧))) ↔ (𝑧𝑥 → ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧)))))
98ralbidv 3164 . . . 4 (𝑦 = 𝐴 → (∀𝑥C (𝑧𝑥 → ((𝑥𝑦) ∨ 𝑧) = (𝑥 ∩ (𝑦 𝑧))) ↔ ∀𝑥C (𝑧𝑥 → ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧)))))
102, 9anbi12d 639 . . 3 (𝑦 = 𝐴 → (((𝑦C𝑧C ) ∧ ∀𝑥C (𝑧𝑥 → ((𝑥𝑦) ∨ 𝑧) = (𝑥 ∩ (𝑦 𝑧)))) ↔ ((𝐴C𝑧C ) ∧ ∀𝑥C (𝑧𝑥 → ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧))))))
11 eleq1 2829 . . . . 5 (𝑧 = 𝐵 → (𝑧C𝐵C ))
1211anbi2d 637 . . . 4 (𝑧 = 𝐵 → ((𝐴C𝑧C ) ↔ (𝐴C𝐵C )))
13 sseq1 3942 . . . . . 6 (𝑧 = 𝐵 → (𝑧𝑥𝐵𝑥))
14 oveq2 7368 . . . . . . 7 (𝑧 = 𝐵 → ((𝑥𝐴) ∨ 𝑧) = ((𝑥𝐴) ∨ 𝐵))
15 oveq2 7368 . . . . . . . 8 (𝑧 = 𝐵 → (𝐴 𝑧) = (𝐴 𝐵))
1615ineq2d 4152 . . . . . . 7 (𝑧 = 𝐵 → (𝑥 ∩ (𝐴 𝑧)) = (𝑥 ∩ (𝐴 𝐵)))
1714, 16eqeq12d 2757 . . . . . 6 (𝑧 = 𝐵 → (((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧)) ↔ ((𝑥𝐴) ∨ 𝐵) = (𝑥 ∩ (𝐴 𝐵))))
1813, 17imbi12d 346 . . . . 5 (𝑧 = 𝐵 → ((𝑧𝑥 → ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧))) ↔ (𝐵𝑥 → ((𝑥𝐴) ∨ 𝐵) = (𝑥 ∩ (𝐴 𝐵)))))
1918ralbidv 3164 . . . 4 (𝑧 = 𝐵 → (∀𝑥C (𝑧𝑥 → ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧))) ↔ ∀𝑥C (𝐵𝑥 → ((𝑥𝐴) ∨ 𝐵) = (𝑥 ∩ (𝐴 𝐵)))))
2012, 19anbi12d 639 . . 3 (𝑧 = 𝐵 → (((𝐴C𝑧C ) ∧ ∀𝑥C (𝑧𝑥 → ((𝑥𝐴) ∨ 𝑧) = (𝑥 ∩ (𝐴 𝑧)))) ↔ ((𝐴C𝐵C ) ∧ ∀𝑥C (𝐵𝑥 → ((𝑥𝐴) ∨ 𝐵) = (𝑥 ∩ (𝐴 𝐵))))))
21 df-dmd 32374 . . 3 𝑀* = {⟨𝑦, 𝑧⟩ ∣ ((𝑦C𝑧C ) ∧ ∀𝑥C (𝑧𝑥 → ((𝑥𝑦) ∨ 𝑧) = (𝑥 ∩ (𝑦 𝑧))))}
2210, 20, 21brabg 5484 . 2 ((𝐴C𝐵C ) → (𝐴 𝑀* 𝐵 ↔ ((𝐴C𝐵C ) ∧ ∀𝑥C (𝐵𝑥 → ((𝑥𝐴) ∨ 𝐵) = (𝑥 ∩ (𝐴 𝐵))))))
2322bianabs 547 1 ((𝐴C𝐵C ) → (𝐴 𝑀* 𝐵 ↔ ∀𝑥C (𝐵𝑥 → ((𝑥𝐴) ∨ 𝐵) = (𝑥 ∩ (𝐴 𝐵)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 397   = wceq 1548  wcel 2121  wral 3055  cin 3884  wss 3885   class class class wbr 5075  (class class class)co 7360   C cch 31022   chj 31026   𝑀* cdmd 31060
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5221  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4842  df-br 5076  df-opab 5138  df-iota 6445  df-fv 6497  df-ov 7363  df-dmd 32374
This theorem is referenced by:  dmdmd  32393  dmdi  32395  dmdbr2  32396  dmdbr3  32398  mddmd2  32402
  Copyright terms: Public domain W3C validator