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

Theorem cmbr 32186
Description: Binary relation expressing 𝐴 commutes with 𝐵. Definition of commutes in [Kalmbach] p. 20. (Contributed by NM, 14-Jun-2004.) (New usage is discouraged.)
Assertion
Ref Expression
cmbr ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝐶ℋ 𝐵 ↔ 𝐴 = ((𝐴 ∩ 𝐵) ∨ℋ (𝐴 ∩ (⊥‘𝐵)))))

Proof of Theorem cmbr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eleq1 2849 . . . . 5 (𝑥 = 𝐴 → (𝑥 ∈ Cℋ ↔ 𝐴 ∈ Cℋ ))
21anbi1d 643 . . . 4 (𝑥 = 𝐴 → ((𝑥 ∈ Cℋ ∧ 𝑦 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝑦 ∈ Cℋ )))
3 id 23 . . . . 5 (𝑥 = 𝐴 → 𝑥 = 𝐴)
4 ineq1 4159 . . . . . 6 (𝑥 = 𝐴 → (𝑥 ∩ 𝑦) = (𝐴 ∩ 𝑦))
5 ineq1 4159 . . . . . 6 (𝑥 = 𝐴 → (𝑥 ∩ (⊥‘𝑦)) = (𝐴 ∩ (⊥‘𝑦)))
64, 5oveq12d 7438 . . . . 5 (𝑥 = 𝐴 → ((𝑥 ∩ 𝑦) ∨ℋ (𝑥 ∩ (⊥‘𝑦))) = ((𝐴 ∩ 𝑦) ∨ℋ (𝐴 ∩ (⊥‘𝑦))))
73, 6eqeq12d 2777 . . . 4 (𝑥 = 𝐴 → (𝑥 = ((𝑥 ∩ 𝑦) ∨ℋ (𝑥 ∩ (⊥‘𝑦))) ↔ 𝐴 = ((𝐴 ∩ 𝑦) ∨ℋ (𝐴 ∩ (⊥‘𝑦)))))
82, 7anbi12d 644 . . 3 (𝑥 = 𝐴 → (((𝑥 ∈ Cℋ ∧ 𝑦 ∈ Cℋ ) ∧ 𝑥 = ((𝑥 ∩ 𝑦) ∨ℋ (𝑥 ∩ (⊥‘𝑦)))) ↔ ((𝐴 ∈ Cℋ ∧ 𝑦 ∈ Cℋ ) ∧ 𝐴 = ((𝐴 ∩ 𝑦) ∨ℋ (𝐴 ∩ (⊥‘𝑦))))))
9 eleq1 2849 . . . . 5 (𝑦 = 𝐵 → (𝑦 ∈ Cℋ ↔ 𝐵 ∈ Cℋ ))
109anbi2d 642 . . . 4 (𝑦 = 𝐵 → ((𝐴 ∈ Cℋ ∧ 𝑦 ∈ Cℋ ) ↔ (𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ )))
11 ineq2 4160 . . . . . 6 (𝑦 = 𝐵 → (𝐴 ∩ 𝑦) = (𝐴 ∩ 𝐵))
12 fveq2 6885 . . . . . . 7 (𝑦 = 𝐵 → (⊥‘𝑦) = (⊥‘𝐵))
1312ineq2d 4166 . . . . . 6 (𝑦 = 𝐵 → (𝐴 ∩ (⊥‘𝑦)) = (𝐴 ∩ (⊥‘𝐵)))
1411, 13oveq12d 7438 . . . . 5 (𝑦 = 𝐵 → ((𝐴 ∩ 𝑦) ∨ℋ (𝐴 ∩ (⊥‘𝑦))) = ((𝐴 ∩ 𝐵) ∨ℋ (𝐴 ∩ (⊥‘𝐵))))
1514eqeq2d 2772 . . . 4 (𝑦 = 𝐵 → (𝐴 = ((𝐴 ∩ 𝑦) ∨ℋ (𝐴 ∩ (⊥‘𝑦))) ↔ 𝐴 = ((𝐴 ∩ 𝐵) ∨ℋ (𝐴 ∩ (⊥‘𝐵)))))
1610, 15anbi12d 644 . . 3 (𝑦 = 𝐵 → (((𝐴 ∈ Cℋ ∧ 𝑦 ∈ Cℋ ) ∧ 𝐴 = ((𝐴 ∩ 𝑦) ∨ℋ (𝐴 ∩ (⊥‘𝑦)))) ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ 𝐴 = ((𝐴 ∩ 𝐵) ∨ℋ (𝐴 ∩ (⊥‘𝐵))))))
17 df-cm 32185 . . 3 𝐶ℋ = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ Cℋ ∧ 𝑦 ∈ Cℋ ) ∧ 𝑥 = ((𝑥 ∩ 𝑦) ∨ℋ (𝑥 ∩ (⊥‘𝑦))))}
188, 16, 17brabg 5514 . 2 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝐶ℋ 𝐵 ↔ ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) ∧ 𝐴 = ((𝐴 ∩ 𝐵) ∨ℋ (𝐴 ∩ (⊥‘𝐵))))))
1918bianabs 551 1 ((𝐴 ∈ Cℋ ∧ 𝐵 ∈ Cℋ ) → (𝐴 𝐶ℋ 𝐵 ↔ 𝐴 = ((𝐴 ∩ 𝐵) ∨ℋ (𝐴 ∩ (⊥‘𝐵)))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∩ cin 3898   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420   Cℋ cch 31531  ⊥cort 31532   ∨ℋ chj 31535   𝐶ℋ ccm 31538
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-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 6494  df-fv 6546  df-ov 7423  df-cm 32185
This theorem is used by:  cmbri  32192  cm2j  32222
  Copyright terms: Public domain W3C validator