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 40267
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 3472 . 2 (𝐾 ∈ 𝐴 → 𝐾 ∈ V)
2 cmtfval.c . . 3 𝐶 = (cm‘𝐾)
3 fveq2 6885 . . . . . . . 8 (𝑝 = 𝐾 → (Base‘𝑝) = (Base‘𝐾))
4 cmtfval.b . . . . . . . 8 𝐵 = (Base‘𝐾)
53, 4eqtr4di 2814 . . . . . . 7 (𝑝 = 𝐾 → (Base‘𝑝) = 𝐵)
65eleq2d 2847 . . . . . 6 (𝑝 = 𝐾 → (𝑥 ∈ (Base‘𝑝) ↔ 𝑥 ∈ 𝐵))
75eleq2d 2847 . . . . . 6 (𝑝 = 𝐾 → (𝑦 ∈ (Base‘𝑝) ↔ 𝑦 ∈ 𝐵))
8 fveq2 6885 . . . . . . . . 9 (𝑝 = 𝐾 → (join‘𝑝) = (join‘𝐾))
9 cmtfval.j . . . . . . . . 9 ∨ = (join‘𝐾)
108, 9eqtr4di 2814 . . . . . . . 8 (𝑝 = 𝐾 → (join‘𝑝) = ∨ )
11 fveq2 6885 . . . . . . . . . 10 (𝑝 = 𝐾 → (meet‘𝑝) = (meet‘𝐾))
12 cmtfval.m . . . . . . . . . 10 ∧ = (meet‘𝐾)
1311, 12eqtr4di 2814 . . . . . . . . 9 (𝑝 = 𝐾 → (meet‘𝑝) = ∧ )
1413oveqd 7437 . . . . . . . 8 (𝑝 = 𝐾 → (𝑥(meet‘𝑝)𝑦) = (𝑥 ∧ 𝑦))
15 eqidd 2762 . . . . . . . . 9 (𝑝 = 𝐾 → 𝑥 = 𝑥)
16 fveq2 6885 . . . . . . . . . . 11 (𝑝 = 𝐾 → (oc‘𝑝) = (oc‘𝐾))
17 cmtfval.o . . . . . . . . . . 11 ⊥ = (oc‘𝐾)
1816, 17eqtr4di 2814 . . . . . . . . . 10 (𝑝 = 𝐾 → (oc‘𝑝) = ⊥ )
1918fveq1d 6887 . . . . . . . . 9 (𝑝 = 𝐾 → ((oc‘𝑝)‘𝑦) = ( ⊥ ‘𝑦))
2013, 15, 19oveq123d 7441 . . . . . . . 8 (𝑝 = 𝐾 → (𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦)) = (𝑥 ∧ ( ⊥ ‘𝑦)))
2110, 14, 20oveq123d 7441 . . . . . . 7 (𝑝 = 𝐾 → ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))) = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))
2221eqeq2d 2772 . . . . . 6 (𝑝 = 𝐾 → (𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))) ↔ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦)))))
236, 7, 223anbi123d 1464 . . . . 5 (𝑝 = 𝐾 → ((𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝) ∧ 𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦)))) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))))
2423opabbidv 5171 . . . 4 (𝑝 = 𝐾 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝) ∧ 𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))})
25 df-cmtN 40234 . . . 4 cm = (𝑝 ∈ V ↦ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (Base‘𝑝) ∧ 𝑦 ∈ (Base‘𝑝) ∧ 𝑥 = ((𝑥(meet‘𝑝)𝑦)(join‘𝑝)(𝑥(meet‘𝑝)((oc‘𝑝)‘𝑦))))})
26 df-3an 1105 . . . . . 6 ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦)))) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦)))))
2726opabbii 5172 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))}
284fvexi 6899 . . . . . . 7 𝐵 ∈ V
2928, 28xpex 7767 . . . . . 6 (𝐵 × 𝐵) ∈ V
30 opabssxp 5743 . . . . . 6 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))} ⊆ (𝐵 × 𝐵)
3129, 30ssexi 5284 . . . . 5 {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))} ∈ V
3227, 31eqeltri 2857 . . . 4 {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))} ∈ V
3324, 25, 32fvmpt 6993 . . 3 (𝐾 ∈ V → (cm‘𝐾) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))})
342, 33eqtrid 2808 . 2 (𝐾 ∈ V → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))})
351, 34syl 18 1 (𝐾 ∈ 𝐴 → 𝐶 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ 𝑥 = ((𝑥 ∧ 𝑦) ∨ (𝑥 ∧ ( ⊥ ‘𝑦))))})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  Vcvv 3451  {copab 5167   × cxp 5649  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  occoc 17436  joincjn 18485  meetcmee 18486  cmccmtN 40230
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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
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-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  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-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6494  df-fun 6540  df-fv 6546  df-ov 7423  df-cmtN 40234
This theorem is used by:  cmtvalN  40268
  Copyright terms: Public domain W3C validator