Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  pprodcnveq Structured version   Visualization version   GIF version

Theorem pprodcnveq 36625
Description: A converse law for parallel product. (Contributed by Scott Fenton, 3-May-2014.)
Assertion
Ref Expression
pprodcnveq pprod(𝑅, 𝑆) = ◡pprod(◡𝑅, ◡𝑆)

Proof of Theorem pprodcnveq
StepHypRef Expression
1 dfpprod2 36624 . 2 pprod(𝑅, 𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
2 dfpprod2 36624 . . . 4 pprod(◡𝑅, ◡𝑆) = ((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
32cnveqi 5852 . . 3 ◡pprod(◡𝑅, ◡𝑆) = ◡((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
4 cnvin 6135 . . 3 ◡((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V))))) = (◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
5 cnvco1 36503 . . . . 5 ◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) = (◡(◡𝑅 ∘ (1st ↾ (V × V))) ∘ (1st ↾ (V × V)))
6 cnvco1 36503 . . . . . 6 ◡(◡𝑅 ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ 𝑅)
76coeq1i 5837 . . . . 5 (◡(◡𝑅 ∘ (1st ↾ (V × V))) ∘ (1st ↾ (V × V))) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∘ (1st ↾ (V × V)))
8 coass 6266 . . . . 5 ((◡(1st ↾ (V × V)) ∘ 𝑅) ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V))))
95, 7, 83eqtri 2788 . . . 4 ◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) = (◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V))))
10 cnvco1 36503 . . . . 5 ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))) = (◡(◡𝑆 ∘ (2nd ↾ (V × V))) ∘ (2nd ↾ (V × V)))
11 cnvco1 36503 . . . . . 6 ◡(◡𝑆 ∘ (2nd ↾ (V × V))) = (◡(2nd ↾ (V × V)) ∘ 𝑆)
1211coeq1i 5837 . . . . 5 (◡(◡𝑆 ∘ (2nd ↾ (V × V))) ∘ (2nd ↾ (V × V))) = ((◡(2nd ↾ (V × V)) ∘ 𝑆) ∘ (2nd ↾ (V × V)))
13 coass 6266 . . . . 5 ((◡(2nd ↾ (V × V)) ∘ 𝑆) ∘ (2nd ↾ (V × V))) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V))))
1410, 12, 133eqtri 2788 . . . 4 ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V))))
159, 14ineq12i 4164 . . 3 (◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V))))) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
163, 4, 153eqtri 2788 . 2 ◡pprod(◡𝑅, ◡𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
171, 16eqtr4i 2787 1 pprod(𝑅, 𝑆) = ◡pprod(◡𝑅, ◡𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  Vcvv 3451   ∩ cin 3898   × cxp 5649  ◡ccnv 5650   ↾ cres 5653   ∘ ccom 5655  1st c1st 7997  2nd c2nd 7998  pprodcpprod 36573
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-11 2194  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-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-txp 36596  df-pprod 36597
This theorem is used by:  brpprod3b  36629
  Copyright terms: Public domain W3C validator