| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > mdi | Structured version Visualization version GIF version | ||
| Description: Consequence of the modular pair property. (Contributed by NM, 22-Jun-2004.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| mdi | ⊢ (((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) ∧ (𝐴 𝑀ℋ 𝐵 ∧ 𝐶 ⊆ 𝐵)) → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mdbr 32683 | . . . . 5 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 ↔ ∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))))) | |
| 2 | 1 | biimpd 232 | . . . 4 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 → ∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))))) |
| 3 | sseq1 3965 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (𝑥 ⊆ 𝐵 ↔ 𝐶 ⊆ 𝐵)) | |
| 4 | oveq1 7430 | . . . . . . . 8 ⊢ (𝑥 = 𝐶 → (𝑥 ∨ℋ 𝐴) = (𝐶 ∨ℋ 𝐴)) | |
| 5 | 4 | ineq1d 4175 | . . . . . . 7 ⊢ (𝑥 = 𝐶 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = ((𝐶 ∨ℋ 𝐴) ∩ 𝐵)) |
| 6 | oveq1 7430 | . . . . . . 7 ⊢ (𝑥 = 𝐶 → (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))) | |
| 7 | 5, 6 | eqeq12d 2782 | . . . . . 6 ⊢ (𝑥 = 𝐶 → (((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵)) ↔ ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵)))) |
| 8 | 3, 7 | imbi12d 347 | . . . . 5 ⊢ (𝑥 = 𝐶 → ((𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) ↔ (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))))) |
| 9 | 8 | rspcv 3580 | . . . 4 ⊢ (𝐶 ∈ Cℋ → (∀𝑥 ∈ Cℋ (𝑥 ⊆ 𝐵 → ((𝑥 ∨ℋ 𝐴) ∩ 𝐵) = (𝑥 ∨ℋ (𝐴 ∩ 𝐵))) → (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))))) |
| 10 | 2, 9 | sylan9 517 | . . 3 ⊢ (((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ 𝐶 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 → (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))))) |
| 11 | 10 | 3impa 1127 | . 2 ⊢ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ∧ 𝐶 ∈ Cℋ ) → (𝐴 𝑀ℋ 𝐵 → (𝐶 ⊆ 𝐵 → ((𝐶 ∨ℋ 𝐴) ∩ 𝐵) = (𝐶 ∨ℋ (𝐴 ∩ 𝐵))))) |
| 12 | 11 | imp32 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 2146 ∀wral 3082 ∩ cin 3907 ⊆ wss 3908 class class class wbr 5114 (class class class)co 7423 Cℋ cch 31318 ∨ℋ chj 31322 𝑀ℋ cmd 31355 |
| 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 2148 ax-9 2156 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| 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 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-iota 6499 df-fv 6551 df-ov 7426 df-md 32669 |
| This theorem is used by: mdsl3 32705 mdslmd3i 32721 mdexchi 32724 atabsi 32790 |
| Copyright terms: Public domain | W3C validator |