Theorem reldmxpc 50475

Description: The binary product of categories is a proper operator, so it can be used with ovprc1 7461, elbasov 17401, strov2rcl 17402, and so on. See reldmxpcALT 50476 for an alternate proof with less "essential steps" but more "bytes". (Proposed by SN, 15-Oct-2025.) (Contributed by Zhi Wang, 15-Oct-2025.)

Assertion

Ref	Expression
reldmxpc	⊢ Rel dom ×c

Proof of Theorem reldmxpc

Step	Hyp	Ref	Expression
1		relxp 5668	. 2 ⊢ Rel (V × V)
2		fnxpc 18357	. . . 4 ⊢ ×c Fn (V × V)
3	2	fndmi 6646	. . 3 ⊢ dom ×c = (V × V)
4	3	releqi 5754	. 2 ⊢ (Rel dom ×c ↔ Rel (V × V))
5	1, 4	mpbir 234	1 ⊢ Rel dom ×c

This proof depends on syntax axioms:  Vcvv 3450   × cxp 5648  dom cdm 5650  Rel wrel 5655   ×_c cxpc 18349

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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7753

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-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-fv 6549  df-oprab 7426  df-mpo 7427  df-1st 8003  df-2nd 8004  df-xpc 18353

This theorem is used by:  elxpcbasex1  50477  elxpcbasex2  50479