Theorem ssrnres 6081

Description: Two ways to express surjectivity of a restricted and corestricted binary relation (intersection of a binary relation with a Cartesian product): the LHS expresses inclusion in the range of the restricted relation, while the RHS expresses equality with the range of the restricted and corestricted relation. (Contributed by NM, 16-Jan-2006.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)

Assertion

Ref	Expression
ssrnres	⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)

Proof of Theorem ssrnres

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		inss2 4163	. . . . 5 ⊢ (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)
2	1	rnssi 5849	. . . 4 ⊢ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵)
3		rnxpss 6075	. . . 4 ⊢ ran (𝐴 × 𝐵) ⊆ 𝐵
4	2, 3	sstri 3930	. . 3 ⊢ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵
5		eqss 3936	. . 3 ⊢ (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ (ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵 ∧ 𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵))))
6	4, 5	mpbiran 706	. 2 ⊢ (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ 𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
7		inxpssres 5606	. . . . 5 ⊢ (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶 ↾ 𝐴)
8	7	rnssi 5849	. . . 4 ⊢ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶 ↾ 𝐴)
9		sstr 3929	. . . 4 ⊢ ((𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ∧ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶 ↾ 𝐴)) → 𝐵 ⊆ ran (𝐶 ↾ 𝐴))
10	8, 9	mpan2 688	. . 3 ⊢ (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) → 𝐵 ⊆ ran (𝐶 ↾ 𝐴))
11		ssel 3914	. . . . . . 7 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) → (𝑦 ∈ 𝐵 → 𝑦 ∈ ran (𝐶 ↾ 𝐴)))
12		vex 3436	. . . . . . . 8 ⊢ 𝑦 ∈ V
13	12	elrn2 5801	. . . . . . 7 ⊢ (𝑦 ∈ ran (𝐶 ↾ 𝐴) ↔ ∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴))
14	11, 13	syl6ib 250	. . . . . 6 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) → (𝑦 ∈ 𝐵 → ∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)))
15	14	ancld 551	. . . . 5 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) → (𝑦 ∈ 𝐵 → (𝑦 ∈ 𝐵 ∧ ∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴))))
16	12	elrn2 5801	. . . . . 6 ⊢ (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)))
17		opelinxp 5666	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
18	12	opelresi 5899	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴) ↔ (𝑥 ∈ 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
19	18	bianassc 640	. . . . . . . 8 ⊢ ((𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
20	17, 19	bitr4i 277	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ (𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)))
21	20	exbii 1850	. . . . . 6 ⊢ (∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥(𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)))
22		19.42v 1957	. . . . . 6 ⊢ (∃𝑥(𝑦 ∈ 𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)))
23	16, 21, 22	3bitri 297	. . . . 5 ⊢ (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑥⟨𝑥, 𝑦⟩ ∈ (𝐶 ↾ 𝐴)))
24	15, 23	syl6ibr 251	. . . 4 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) → (𝑦 ∈ 𝐵 → 𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵))))
25	24	ssrdv 3927	. . 3 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) → 𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
26	10, 25	impbii 208	. 2 ⊢ (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ 𝐵 ⊆ ran (𝐶 ↾ 𝐴))
27	6, 26	bitr2i 275	1 ⊢ (𝐵 ⊆ ran (𝐶 ↾ 𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1539  ∃wex 1782   ∈ wcel 2106   ∩ cin 3886   ⊆ wss 3887  ⟨cop 4567   × cxp 5587  ran crn 5590   ↾ cres 5591

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-cnv 5597  df-dm 5599  df-rn 5600  df-res 5601

This theorem is referenced by:  rninxp  6082