Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssrnres Structured version   Visualization version   GIF version

Theorem ssrnres 5491
 Description: Subset of the range of a restriction. (Contributed by NM, 16-Jan-2006.)
Assertion
Ref Expression
ssrnres (𝐵 ⊆ ran (𝐶𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)

Proof of Theorem ssrnres
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inss2 3796 . . . . 5 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)
2 rnss 5275 . . . . 5 ((𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵) → ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵))
31, 2ax-mp 5 . . . 4 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵)
4 rnxpss 5485 . . . 4 ran (𝐴 × 𝐵) ⊆ 𝐵
53, 4sstri 3577 . . 3 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵
6 eqss 3583 . . 3 (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ (ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵))))
75, 6mpbiran 955 . 2 (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
8 ssid 3587 . . . . . . . 8 𝐴𝐴
9 ssv 3588 . . . . . . . 8 𝐵 ⊆ V
10 xpss12 5148 . . . . . . . 8 ((𝐴𝐴𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V))
118, 9, 10mp2an 704 . . . . . . 7 (𝐴 × 𝐵) ⊆ (𝐴 × V)
12 sslin 3801 . . . . . . 7 ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶 ∩ (𝐴 × V)))
1311, 12ax-mp 5 . . . . . 6 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶 ∩ (𝐴 × V))
14 df-res 5050 . . . . . 6 (𝐶𝐴) = (𝐶 ∩ (𝐴 × V))
1513, 14sseqtr4i 3601 . . . . 5 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶𝐴)
16 rnss 5275 . . . . 5 ((𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶𝐴) → ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴))
1715, 16ax-mp 5 . . . 4 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴)
18 sstr 3576 . . . 4 ((𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ∧ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴)) → 𝐵 ⊆ ran (𝐶𝐴))
1917, 18mpan2 703 . . 3 (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) → 𝐵 ⊆ ran (𝐶𝐴))
20 ssel 3562 . . . . . . 7 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵𝑦 ∈ ran (𝐶𝐴)))
21 vex 3176 . . . . . . . 8 𝑦 ∈ V
2221elrn2 5286 . . . . . . 7 (𝑦 ∈ ran (𝐶𝐴) ↔ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴))
2320, 22syl6ib 240 . . . . . 6 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵 → ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
2423ancrd 575 . . . . 5 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵 → (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵)))
2521elrn2 5286 . . . . . 6 (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)))
26 elin 3758 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
27 opelxp 5070 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
2827anbi2i 726 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ (𝑥𝐴𝑦𝐵)))
2921opelres 5322 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑥𝐴))
3029anbi1i 727 . . . . . . . . 9 ((⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵) ↔ ((⟨𝑥, 𝑦⟩ ∈ 𝐶𝑥𝐴) ∧ 𝑦𝐵))
31 anass 679 . . . . . . . . 9 (((⟨𝑥, 𝑦⟩ ∈ 𝐶𝑥𝐴) ∧ 𝑦𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ (𝑥𝐴𝑦𝐵)))
3230, 31bitr2i 264 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ (𝑥𝐴𝑦𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3326, 28, 323bitri 285 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3433exbii 1764 . . . . . 6 (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥(⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
35 19.41v 1901 . . . . . 6 (∃𝑥(⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵) ↔ (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3625, 34, 353bitri 285 . . . . 5 (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3724, 36syl6ibr 241 . . . 4 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵))))
3837ssrdv 3574 . . 3 (𝐵 ⊆ ran (𝐶𝐴) → 𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
3919, 38impbii 198 . 2 (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ 𝐵 ⊆ ran (𝐶𝐴))
407, 39bitr2i 264 1 (𝐵 ⊆ ran (𝐶𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   ∧ wa 383   = wceq 1475  ∃wex 1695   ∈ wcel 1977  Vcvv 3173   ∩ cin 3539   ⊆ wss 3540  ⟨cop 4131   × cxp 5036  ran crn 5039   ↾ cres 5040 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-rel 5045  df-cnv 5046  df-dm 5048  df-rn 5049  df-res 5050 This theorem is referenced by:  rninxp  5492
 Copyright terms: Public domain W3C validator