Theorem rninxp 6135

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 3911	. 2 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) ↔ ∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝐶 ↾ 𝐴))
2		ssrnres 6134	. 2 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)
3		df-ima 5635	. . . . 5 ⊢ (𝐶 “ 𝐴) = ran (𝐶 ↾ 𝐴)
4	3	eleq2i 2829	. . . 4 ⊢ (𝑦 ∈ (𝐶 “ 𝐴) ↔ 𝑦 ∈ ran (𝐶 ↾ 𝐴))
5		vex 3434	. . . . 5 ⊢ 𝑦 ∈ V
6	5	elima 6022	. . . 4 ⊢ (𝑦 ∈ (𝐶 “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)
7	4, 6	bitr3i 277	. . 3 ⊢ (𝑦 ∈ ran (𝐶 ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)
8	7	ralbii 3084	. 2 ⊢ (∀𝑦 ∈ 𝐵 𝑦 ∈ ran (𝐶 ↾ 𝐴) ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)
9	1, 2, 8	3bitr3i 301	1 ⊢ (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑥𝐶𝑦)

Syntax hints:   ↔ wb 206   = wceq 1542   ∈ wcel 2114  ∀wral 3052  ∃wrex 3062   ∩ cin 3889   ⊆ wss 3890   class class class wbr 5086   × cxp 5620  ran crn 5623   ↾ cres 5624   “ cima 5625

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-11 2163  ax-ext 2709  ax-sep 5231  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-xp 5628  df-rel 5629  df-cnv 5630  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635

This theorem is referenced by:  dminxp  6136  fncnv  6563  exfo  7049  brdom3  10439  brdom5  10440  brdom4  10441