Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cmtvalN Structured version   Visualization version   GIF version

Theorem cmtvalN 39493
Description: Equivalence for commutes relation. Definition of commutes in [Kalmbach] p. 20. (cmbr 31661 analog.) (Contributed by NM, 6-Nov-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
cmtfval.b 𝐵 = (Base‘𝐾)
cmtfval.j = (join‘𝐾)
cmtfval.m = (meet‘𝐾)
cmtfval.o = (oc‘𝐾)
cmtfval.c 𝐶 = (cm‘𝐾)
Assertion
Ref Expression
cmtvalN ((𝐾𝐴𝑋𝐵𝑌𝐵) → (𝑋𝐶𝑌𝑋 = ((𝑋 𝑌) (𝑋 ( 𝑌)))))

Proof of Theorem cmtvalN
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cmtfval.b . . . . . 6 𝐵 = (Base‘𝐾)
2 cmtfval.j . . . . . 6 = (join‘𝐾)
3 cmtfval.m . . . . . 6 = (meet‘𝐾)
4 cmtfval.o . . . . . 6 = (oc‘𝐾)
5 cmtfval.c . . . . . 6 𝐶 = (cm‘𝐾)
61, 2, 3, 4, 5cmtfvalN 39492 . . . . 5 (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
7 df-3an 1088 . . . . . 6 ((𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦)))) ↔ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦)))))
87opabbii 5165 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}
96, 8eqtrdi 2787 . . . 4 (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
109breqd 5109 . . 3 (𝐾𝐴 → (𝑋𝐶𝑌𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}𝑌))
11103ad2ant1 1133 . 2 ((𝐾𝐴𝑋𝐵𝑌𝐵) → (𝑋𝐶𝑌𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}𝑌))
12 df-br 5099 . . . 4 (𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}𝑌 ↔ ⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
13 id 22 . . . . . 6 (𝑥 = 𝑋𝑥 = 𝑋)
14 oveq1 7365 . . . . . . 7 (𝑥 = 𝑋 → (𝑥 𝑦) = (𝑋 𝑦))
15 oveq1 7365 . . . . . . 7 (𝑥 = 𝑋 → (𝑥 ( 𝑦)) = (𝑋 ( 𝑦)))
1614, 15oveq12d 7376 . . . . . 6 (𝑥 = 𝑋 → ((𝑥 𝑦) (𝑥 ( 𝑦))) = ((𝑋 𝑦) (𝑋 ( 𝑦))))
1713, 16eqeq12d 2752 . . . . 5 (𝑥 = 𝑋 → (𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))) ↔ 𝑋 = ((𝑋 𝑦) (𝑋 ( 𝑦)))))
18 oveq2 7366 . . . . . . 7 (𝑦 = 𝑌 → (𝑋 𝑦) = (𝑋 𝑌))
19 fveq2 6834 . . . . . . . 8 (𝑦 = 𝑌 → ( 𝑦) = ( 𝑌))
2019oveq2d 7374 . . . . . . 7 (𝑦 = 𝑌 → (𝑋 ( 𝑦)) = (𝑋 ( 𝑌)))
2118, 20oveq12d 7376 . . . . . 6 (𝑦 = 𝑌 → ((𝑋 𝑦) (𝑋 ( 𝑦))) = ((𝑋 𝑌) (𝑋 ( 𝑌))))
2221eqeq2d 2747 . . . . 5 (𝑦 = 𝑌 → (𝑋 = ((𝑋 𝑦) (𝑋 ( 𝑦))) ↔ 𝑋 = ((𝑋 𝑌) (𝑋 ( 𝑌)))))
2317, 22opelopab2 5489 . . . 4 ((𝑋𝐵𝑌𝐵) → (⟨𝑋, 𝑌⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))} ↔ 𝑋 = ((𝑋 𝑌) (𝑋 ( 𝑌)))))
2412, 23bitrid 283 . . 3 ((𝑋𝐵𝑌𝐵) → (𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}𝑌𝑋 = ((𝑋 𝑌) (𝑋 ( 𝑌)))))
25243adant1 1130 . 2 ((𝐾𝐴𝑋𝐵𝑌𝐵) → (𝑋{⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}𝑌𝑋 = ((𝑋 𝑌) (𝑋 ( 𝑌)))))
2611, 25bitrd 279 1 ((𝐾𝐴𝑋𝐵𝑌𝐵) → (𝑋𝐶𝑌𝑋 = ((𝑋 𝑌) (𝑋 ( 𝑌)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1541  wcel 2113  cop 4586   class class class wbr 5098  {copab 5160  cfv 6492  (class class class)co 7358  Basecbs 17138  occoc 17187  joincjn 18236  meetcmee 18237  cmccmtN 39455
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-iota 6448  df-fun 6494  df-fv 6500  df-ov 7361  df-cmtN 39459
This theorem is referenced by:  cmtcomlemN  39530  cmt2N  39532  cmtbr2N  39535  cmtbr3N  39536
  Copyright terms: Public domain W3C validator