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

Theorem mdi 32879
Description: Consequence of the modular pair property. (Contributed by NM, 22-Jun-2004.) (New usage is discouraged.)
Assertion
Ref Expression
mdi (((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) ∧ (𝐴 𝑀ℋ 𝐵 ∧ 𝐶 ⊆ 𝐵)) → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))

Proof of Theorem mdi
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 mdbr 32878 . . . . 5 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 ↔ ∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)))))
21biimpd 232 . . . 4 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 → ∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)))))
3 sseq1 3956 . . . . . 6 (𝑥 = 𝐶 → (𝑥 ⊆ 𝐵 ↔ 𝐶 ⊆ 𝐵))
4 oveq1 7419 . . . . . . . 8 (𝑥 = 𝐶 → (𝑥 ∨ℋ 𝐴) = (𝐶 ∨ℋ 𝐴))
54ineq1d 4165 . . . . . . 7 (𝑥 = 𝐶 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = ((𝐶 ∨ℋ 𝐴) ∩ 𝐵))
6 oveq1 7419 . . . . . . 7 (𝑥 = 𝐶 → (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))
75, 6eqeq12d 2777 . . . . . 6 (𝑥 = 𝐶 → (((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) ↔ ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))))
83, 7imbi12d 347 . . . . 5 (𝑥 = 𝐶 → ((𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) ↔ (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))))
98rspcv 3573 . . . 4 (𝐶 ∈ Cℋ → (∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) → (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))))
102, 9sylan9 517 . . 3 (((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ 𝐶 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 → (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))))
11103impa 1127 . 2 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 → (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))))
1211imp32 424 1 (((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) ∧ (𝐴 𝑀ℋ 𝐵 ∧ 𝐶 ⊆ 𝐵)) → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ∩ cin 3898   ⊆ wss 3899   class class class wbr 5103  (class class class)co 7412   Cℋ cch 31513   ∨ℋ chj 31517   𝑀ℋ cmd 31550
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-iota 6487  df-fv 6539  df-ov 7415  df-md 32864
This theorem is used by:  mdsl3  32900  mdslmd3i  32916  mdexchi  32919  atabsi  32985
  Copyright terms: Public domain W3C validator