Theorem rninxp 6154

Description: Two ways to express surjectivity of a restricted and corestricted binary relation (intersection of a binary relation with a Cartesian product). (Contributed by NM, 17-Jan-2006.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)

Assertion

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

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

Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem rninxp

Step	Hyp	Ref	Expression
1		dfss3 3920	. 2 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝐶 ↾ 𝐴))
2		ssrnres 6153	. 2 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)
3		df-ima 5653	. . . . 5 ⊢ (𝐶 “ 𝐴) = ran (𝐶 ↾ 𝐴)
4	3	eleq2i 2848	. . . 4 ⊢ (𝑦 ∈ (𝐶 “ 𝐴) ↔ 𝑦 ∈ ran (𝐶 ↾ 𝐴))
5		vex 3452	. . . . 5 ⊢ 𝑦 ∈ V
6	5	elima 6044	. . . 4 ⊢ (𝑦 ∈ (𝐶 “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)
7	4, 6	bitr3i 279	. . 3 ⊢ (𝑦 ∈ ran (𝐶 ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)
8	7	ralbii 3102	. 2 ⊢ (∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝐶 ↾ 𝐴) ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)
9	1, 2, 8	3bitr3i 303	1 ⊢ (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)

Syntax hints:   ↔ wb 208   = wceq 1554   ∈ wcel 2136  ∀wral 3070  ∃wrex 3080   ∩ cin 3898   ⊆ wss 3899   class class class wbr 5094   × cxp 5638  ran crn 5641   ↾ cres 5642   “ cima 5643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1809  ax-4 1823  ax-5 1924  ax-6 1981  ax-7 2022  ax-8 2138  ax-9 2146  ax-11 2185  ax-ext 2728  ax-sep 5240  ax-pr 5384

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1557  df-fal 1567  df-ex 1794  df-sb 2085  df-clab 2735  df-cleq 2748  df-clel 2831  df-ne 2952  df-ral 3071  df-rex 3081  df-rab 3409  df-v 3450  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4281  df-if 4475  df-sn 4577  df-pr 4579  df-op 4583  df-br 5095  df-opab 5157  df-xp 5646  df-rel 5647  df-cnv 5648  df-dm 5650  df-rn 5651  df-res 5652  df-ima 5653

This theorem is referenced by:  dminxp  6155  fncnv  6583  exfo  7075  brdom3  10475  brdom5  10476  brdom4  10477