Theorem pprodcnveq 36738

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 36737	. 2 ⊢ pprod(𝑅, 𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
2		dfpprod2 36737	. . . 4 ⊢ pprod(◡𝑅, ◡𝑆) = ((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
3	2	cnveqi 5851	. . 3 ⊢ ◡pprod(◡𝑅, ◡𝑆) = ◡((◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))))
4		cnvin 6134	. . 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 36617	. . . . 5 ⊢ ◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) = (◡(◡𝑅 ∘ (1st ↾ (V × V))) ∘ (1st ↾ (V × V)))
6		cnvco1 36617	. . . . . 6 ⊢ ◡(◡𝑅 ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ 𝑅)
7	6	coeq1i 5836	. . . . 5 ⊢ (◡(◡𝑅 ∘ (1st ↾ (V × V))) ∘ (1st ↾ (V × V))) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∘ (1st ↾ (V × V)))
8		coass 6267	. . . . 5 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∘ (1st ↾ (V × V))) = (◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V))))
9	5, 7, 8	3eqtri 2787	. . . 4 ⊢ ◡(◡(1st ↾ (V × V)) ∘ (◡𝑅 ∘ (1st ↾ (V × V)))) = (◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V))))
10		cnvco1 36617	. . . . 5 ⊢ ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))) = (◡(◡𝑆 ∘ (2nd ↾ (V × V))) ∘ (2nd ↾ (V × V)))
11		cnvco1 36617	. . . . . 6 ⊢ ◡(◡𝑆 ∘ (2nd ↾ (V × V))) = (◡(2nd ↾ (V × V)) ∘ 𝑆)
12	11	coeq1i 5836	. . . . 5 ⊢ (◡(◡𝑆 ∘ (2nd ↾ (V × V))) ∘ (2nd ↾ (V × V))) = ((◡(2nd ↾ (V × V)) ∘ 𝑆) ∘ (2nd ↾ (V × V)))
13		coass 6267	. . . . 5 ⊢ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ∘ (2nd ↾ (V × V))) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V))))
14	10, 12, 13	3eqtri 2787	. . . 4 ⊢ ◡(◡(2nd ↾ (V × V)) ∘ (◡𝑆 ∘ (2nd ↾ (V × V)))) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V))))
15	9, 14	ineq12i 4115	. . 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 2787	. 2 ⊢ ◡pprod(◡𝑅, ◡𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ∘ (1st ↾ (V × V)))) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ∘ (2nd ↾ (V × V)))))
17	1, 16	eqtr4i 2786	1 ⊢ pprod(𝑅, 𝑆) = ◡pprod(◡𝑅, ◡𝑆)

This proof depends on syntax axioms:   = wceq 1569  Vcvv 3450   ∩ cin 4089   × cxp 5648  ^◡ccnv 5649   ↾ cres 5652   ∘ ccom 5654  1^st c1st 8000  2^nd c2nd 8001  pprodcpprod 36686

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-11 2193  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-txp 36709  df-pprod 36710

This theorem is used by:  brpprod3b  36742