Theorem pprodcnveq 36394

Description: A converse law for parallel product. (Contributed by Scott Fenton, 3-May-2014.)

Assertion

Ref	Expression
pprodcnveq	⊢ pprod(𝑅, 𝑆) = ◡pprod(◡𝑅, ◡𝑆)

Proof of Theorem pprodcnveq

Step	Hyp	Ref	Expression
1		dfpprod2 36393	. 2 ⊢ pprod(𝑅, 𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
2		dfpprod2 36393	. . . 4 ⊢ pprod(◡𝑅, ◡𝑆) = ((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
3	2	cnveqi 5865	. . 3 ⊢ ◡pprod(◡𝑅, ◡𝑆) = ◡((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
4		cnvin 6146	. . 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 36272	. . . . 5 ⊢ ◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) = (◡(◡𝑅 ∘ (1st ↾ (V × V))) ∘ (1st ↾ (V × V)))
6		cnvco1 36272	. . . . . 6 ⊢ ◡(◡𝑅 ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ 𝑅)
7	6	coeq1i 5850	. . . . 5 ⊢ (◡(◡𝑅 ∘ (1st ↾ (V × V))) ∘ (1st ↾ (V × V))) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∘ (1st ↾ (V × V)))
8		coass 6272	. . . . 5 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V))))
9	5, 7, 8	3eqtri 2793	. . . 4 ⊢ ◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) = (◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V))))
10		cnvco1 36272	. . . . 5 ⊢ ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))) = (◡(◡𝑆 ∘ (2nd ↾ (V × V))) ∘ (2nd ↾ (V × V)))
11		cnvco1 36272	. . . . . 6 ⊢ ◡(◡𝑆 ∘ (2nd ↾ (V × V))) = (◡(2nd ↾ (V × V)) ∘ 𝑆)
12	11	coeq1i 5850	. . . . 5 ⊢ (◡(◡𝑆 ∘ (2nd ↾ (V × V))) ∘ (2nd ↾ (V × V))) = ((◡(2nd ↾ (V × V)) ∘ 𝑆) ∘ (2nd ↾ (V × V)))
13		coass 6272	. . . . 5 ⊢ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ∘ (2nd ↾ (V × V))) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V))))
14	10, 12, 13	3eqtri 2793	. . . 4 ⊢ ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V))))
15	9, 14	ineq12i 4174	. . 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)))))
16	3, 4, 15	3eqtri 2793	. 2 ⊢ ◡pprod(◡𝑅, ◡𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
17	1, 16	eqtr4i 2792	1 ⊢ pprod(𝑅, 𝑆) = ◡pprod(◡𝑅, ◡𝑆)

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3458   ∩ cin 3907   × cxp 5664  ^◡ccnv 5665   ↾ cres 5668   ∘ ccom 5670  1^st c1st 7993  2^nd c2nd 7994  pprodcpprod 36342

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 2148  ax-9 2156  ax-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-txp 36365  df-pprod 36366

This theorem is used by:  brpprod3b  36398