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

Theorem ssrnres 6008
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.
StepHypRef Expression
1 inss2 4181 . . . . 5 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)
21rnssi 5783 . . . 4 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵)
3 rnxpss 6002 . . . 4 ran (𝐴 × 𝐵) ⊆ 𝐵
42, 3sstri 3952 . . 3 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵
5 eqss 3958 . . 3 (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ (ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵))))
64, 5mpbiran 708 . 2 (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
7 inxpssres 5545 . . . . 5 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶𝐴)
87rnssi 5783 . . . 4 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴)
9 sstr 3951 . . . 4 ((𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ∧ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴)) → 𝐵 ⊆ ran (𝐶𝐴))
108, 9mpan2 690 . . 3 (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) → 𝐵 ⊆ ran (𝐶𝐴))
11 ssel 3937 . . . . . . 7 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵𝑦 ∈ ran (𝐶𝐴)))
12 vex 3474 . . . . . . . 8 𝑦 ∈ V
1312elrn2 5794 . . . . . . 7 (𝑦 ∈ ran (𝐶𝐴) ↔ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴))
1411, 13syl6ib 254 . . . . . 6 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵 → ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
1514ancld 554 . . . . 5 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵 → (𝑦𝐵 ∧ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴))))
1612elrn2 5794 . . . . . 6 (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)))
17 opelinxp 5604 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ ((𝑥𝐴𝑦𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
1812opelresi 5834 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ↔ (𝑥𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
1918bianassc 642 . . . . . . . 8 ((𝑦𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴)) ↔ ((𝑥𝐴𝑦𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐶))
2017, 19bitr4i 281 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ (𝑦𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
2120exbii 1849 . . . . . 6 (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥(𝑦𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
22 19.42v 1955 . . . . . 6 (∃𝑥(𝑦𝐵 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
2316, 21, 223bitri 300 . . . . 5 (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ (𝑦𝐵 ∧ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
2415, 23syl6ibr 255 . . . 4 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵))))
2524ssrdv 3949 . . 3 (𝐵 ⊆ ran (𝐶𝐴) → 𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
2610, 25impbii 212 . 2 (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ 𝐵 ⊆ ran (𝐶𝐴))
276, 26bitr2i 279 1 (𝐵 ⊆ ran (𝐶𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 399   = wceq 1538  wex 1781  wcel 2115  cin 3909  wss 3910  cop 4546   × cxp 5526  ran crn 5529  cres 5530
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 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pr 5303
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-rab 3135  df-v 3473  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4267  df-if 4441  df-sn 4541  df-pr 4543  df-op 4547  df-br 5040  df-opab 5102  df-xp 5534  df-rel 5535  df-cnv 5536  df-dm 5538  df-rn 5539  df-res 5540
This theorem is referenced by:  rninxp  6009
  Copyright terms: Public domain W3C validator