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

Theorem cmtfvalN 36361
Description: Value of commutes relation. (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
cmtfvalN (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦
Allowed substitution hints:   𝐴(𝑥,𝑦)   𝐶(𝑥,𝑦)   (𝑥,𝑦)   (𝑥,𝑦)   (𝑥,𝑦)

Proof of Theorem cmtfvalN
Dummy variable 𝑝 is distinct from all other variables.
StepHypRef Expression
1 elex 3512 . 2 (𝐾𝐴𝐾 ∈ V)
2 cmtfval.c . . 3 𝐶 = (cm‘𝐾)
3 fveq2 6670 . . . . . . . 8 (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4 cmtfval.b . . . . . . . 8 𝐵 = (Base‘𝐾)
53, 4syl6eqr 2874 . . . . . . 7 (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
65eleq2d 2898 . . . . . 6 (𝑝 = 𝐾 → (𝑥 ∈ (Base‘𝑝) ↔ 𝑥𝐵))
75eleq2d 2898 . . . . . 6 (𝑝 = 𝐾 → (𝑦 ∈ (Base‘𝑝) ↔ 𝑦𝐵))
8 fveq2 6670 . . . . . . . . 9 (𝑝 = 𝐾 → (join‘𝑝) = (join‘𝐾))
9 cmtfval.j . . . . . . . . 9 = (join‘𝐾)
108, 9syl6eqr 2874 . . . . . . . 8 (𝑝 = 𝐾 → (join‘𝑝) = )
11 fveq2 6670 . . . . . . . . . 10 (𝑝 = 𝐾 → (meet‘𝑝) = (meet‘𝐾))
12 cmtfval.m . . . . . . . . . 10 = (meet‘𝐾)
1311, 12syl6eqr 2874 . . . . . . . . 9 (𝑝 = 𝐾 → (meet‘𝑝) = )
1413oveqd 7173 . . . . . . . 8 (𝑝 = 𝐾 → (𝑥(meet‘𝑝)𝑦) = (𝑥 𝑦))
15 eqidd 2822 . . . . . . . . 9 (𝑝 = 𝐾𝑥 = 𝑥)
16 fveq2 6670 . . . . . . . . . . 11 (𝑝 = 𝐾 → (oc‘𝑝) = (oc‘𝐾))
17 cmtfval.o . . . . . . . . . . 11 = (oc‘𝐾)
1816, 17syl6eqr 2874 . . . . . . . . . 10 (𝑝 = 𝐾 → (oc‘𝑝) = )
1918fveq1d 6672 . . . . . . . . 9 (𝑝 = 𝐾 → ((oc‘𝑝)‘𝑦) = ( 𝑦))
2013, 15, 19oveq123d 7177 . . . . . . . 8 (𝑝 = 𝐾 → (𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦)) = (𝑥 ( 𝑦)))
2110, 14, 20oveq123d 7177 . . . . . . 7 (𝑝 = 𝐾 → ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))) = ((𝑥 𝑦) (𝑥 ( 𝑦))))
2221eqeq2d 2832 . . . . . 6 (𝑝 = 𝐾 → (𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))) ↔ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦)))))
236, 7, 223anbi123d 1432 . . . . 5 (𝑝 = 𝐾 → ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝) ∧ 𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦)))) ↔ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))))
2423opabbidv 5132 . . . 4 (𝑝 = 𝐾 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝) ∧ 𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
25 df-cmtN 36328 . . . 4 cm = (𝑝 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝) ∧ 𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))))})
26 df-3an 1085 . . . . . 6 ((𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦)))) ↔ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦)))))
2726opabbii 5133 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))}
284fvexi 6684 . . . . . . 7 𝐵 ∈ V
2928, 28xpex 7476 . . . . . 6 (𝐵 × 𝐵) ∈ V
30 opabssxp 5643 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))} ⊆ (𝐵 × 𝐵)
3129, 30ssexi 5226 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐵𝑦𝐵) ∧ 𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))} ∈ V
3227, 31eqeltri 2909 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))} ∈ V
3324, 25, 32fvmpt 6768 . . 3 (𝐾 ∈ V → (cm‘𝐾) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
342, 33syl5eq 2868 . 2 (𝐾 ∈ V → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
351, 34syl 17 1 (𝐾𝐴𝐶 = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝑦𝐵𝑥 = ((𝑥 𝑦) (𝑥 ( 𝑦))))})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  Vcvv 3494  {copab 5128   × cxp 5553  cfv 6355  (class class class)co 7156  Basecbs 16483  occoc 16573  joincjn 17554  meetcmee 17555  cmccmtN 36324
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3773  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-opab 5129  df-mpt 5147  df-id 5460  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-iota 6314  df-fun 6357  df-fv 6363  df-ov 7159  df-cmtN 36328
This theorem is referenced by:  cmtvalN  36362
  Copyright terms: Public domain W3C validator