Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  caovdid Structured version   GIF version

Theorem caovdid 5618
 Description: Convert an operation distributive law to class notation. (Contributed by Mario Carneiro, 30-Dec-2014.)
Hypotheses
Ref Expression
caovdig.1 ((φ (x 𝐾 y 𝑆 z 𝑆)) → (x𝐺(y𝐹z)) = ((x𝐺y)𝐻(x𝐺z)))
caovdid.2 (φA 𝐾)
caovdid.3 (φB 𝑆)
caovdid.4 (φ𝐶 𝑆)
Assertion
Ref Expression
caovdid (φ → (A𝐺(B𝐹𝐶)) = ((A𝐺B)𝐻(A𝐺𝐶)))
Distinct variable groups:   x,y,z,A   x,B,y,z   x,𝐶,y,z   φ,x,y,z   x,𝐹,y,z   x,𝐺,y,z   x,𝐻,y,z   x,𝐾,y,z   x,𝑆,y,z

Proof of Theorem caovdid
StepHypRef Expression
1 id 19 . 2 (φφ)
2 caovdid.2 . 2 (φA 𝐾)
3 caovdid.3 . 2 (φB 𝑆)
4 caovdid.4 . 2 (φ𝐶 𝑆)
5 caovdig.1 . . 3 ((φ (x 𝐾 y 𝑆 z 𝑆)) → (x𝐺(y𝐹z)) = ((x𝐺y)𝐻(x𝐺z)))
65caovdig 5617 . 2 ((φ (A 𝐾 B 𝑆 𝐶 𝑆)) → (A𝐺(B𝐹𝐶)) = ((A𝐺B)𝐻(A𝐺𝐶)))
71, 2, 3, 4, 6syl13anc 1136 1 (φ → (A𝐺(B𝐹𝐶)) = ((A𝐺B)𝐻(A𝐺𝐶)))
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   ∧ w3a 884   = wceq 1242   ∈ wcel 1390  (class class class)co 5455 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 629  ax-5 1333  ax-7 1334  ax-gen 1335  ax-ie1 1379  ax-ie2 1380  ax-8 1392  ax-10 1393  ax-11 1394  ax-i12 1395  ax-bnd 1396  ax-4 1397  ax-17 1416  ax-i9 1420  ax-ial 1424  ax-i5r 1425  ax-ext 2019 This theorem depends on definitions:  df-bi 110  df-3an 886  df-tru 1245  df-nf 1347  df-sb 1643  df-clab 2024  df-cleq 2030  df-clel 2033  df-nfc 2164  df-ral 2305  df-rex 2306  df-v 2553  df-un 2916  df-sn 3373  df-pr 3374  df-op 3376  df-uni 3572  df-br 3756  df-iota 4810  df-fv 4853  df-ov 5458 This theorem is referenced by:  caovdir2d  5619  caovlem2d  5635  ltanqg  6384
 Copyright terms: Public domain W3C validator