Theorem dminxp 6072

Description: Two ways to express totality of a restricted and corestricted binary relation (intersection of a binary relation with a Cartesian product). (Contributed by NM, 17-Jan-2006.)

Assertion

Ref	Expression
dminxp	⊢ (dom (𝐶 ∩ (𝐴 × 𝐵)) = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥𝐶𝑦)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑦,𝐵   𝑥,𝐶,𝑦

Allowed substitution hint:   𝐴(𝑦)

Proof of Theorem dminxp

Step	Hyp	Ref	Expression
1		dfdm4 5793	. . . 4 ⊢ dom (𝐶 ∩ (𝐴 × 𝐵)) = ran ◡(𝐶 ∩ (𝐴 × 𝐵))
2		cnvin 6037	. . . . . 6 ⊢ ◡(𝐶 ∩ (𝐴 × 𝐵)) = (◡𝐶 ∩ ◡(𝐴 × 𝐵))
3		cnvxp 6049	. . . . . . 7 ⊢ ◡(𝐴 × 𝐵) = (𝐵 × 𝐴)
4	3	ineq2i 4140	. . . . . 6 ⊢ (◡𝐶 ∩ ◡(𝐴 × 𝐵)) = (◡𝐶 ∩ (𝐵 × 𝐴))
5	2, 4	eqtri 2766	. . . . 5 ⊢ ◡(𝐶 ∩ (𝐴 × 𝐵)) = (◡𝐶 ∩ (𝐵 × 𝐴))
6	5	rneqi 5835	. . . 4 ⊢ ran ◡(𝐶 ∩ (𝐴 × 𝐵)) = ran (◡𝐶 ∩ (𝐵 × 𝐴))
7	1, 6	eqtri 2766	. . 3 ⊢ dom (𝐶 ∩ (𝐴 × 𝐵)) = ran (◡𝐶 ∩ (𝐵 × 𝐴))
8	7	eqeq1i 2743	. 2 ⊢ (dom (𝐶 ∩ (𝐴 × 𝐵)) = 𝐴 ↔ ran (◡𝐶 ∩ (𝐵 × 𝐴)) = 𝐴)
9		rninxp 6071	. 2 ⊢ (ran (◡𝐶 ∩ (𝐵 × 𝐴)) = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑦◡𝐶𝑥)
10		vex 3426	. . . . 5 ⊢ 𝑦 ∈ V
11		vex 3426	. . . . 5 ⊢ 𝑥 ∈ V
12	10, 11	brcnv 5780	. . . 4 ⊢ (𝑦◡𝐶𝑥 ↔ 𝑥𝐶𝑦)
13	12	rexbii 3177	. . 3 ⊢ (∃𝑦 ∈ 𝐵 𝑦◡𝐶𝑥 ↔ ∃𝑦 ∈ 𝐵 𝑥𝐶𝑦)
14	13	ralbii 3090	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑦◡𝐶𝑥 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥𝐶𝑦)
15	8, 9, 14	3bitri 296	1 ⊢ (dom (𝐶 ∩ (𝐴 × 𝐵)) = 𝐴 ↔ ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑥𝐶𝑦)

Syntax hints:   ↔ wb 205   = wceq 1539  ∀wral 3063  ∃wrex 3064   ∩ cin 3882   class class class wbr 5070   × cxp 5578  ^◡ccnv 5579  dom cdm 5580  ran crn 5581

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-cnv 5588  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593

This theorem is referenced by:  trust  23289