ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  ssrnres GIF version

Theorem ssrnres 5112
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 3384 . . . . 5 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)
2 rnss 4896 . . . . 5 ((𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵) → ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵))
31, 2ax-mp 5 . . . 4 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐴 × 𝐵)
4 rnxpss 5101 . . . 4 ran (𝐴 × 𝐵) ⊆ 𝐵
53, 4sstri 3192 . . 3 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵
6 eqss 3198 . . 3 (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵 ↔ (ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ 𝐵𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵))))
75, 6mpbiran 942 . 2 (ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
8 ssid 3203 . . . . . . . 8 𝐴𝐴
9 ssv 3205 . . . . . . . 8 𝐵 ⊆ V
10 xpss12 4770 . . . . . . . 8 ((𝐴𝐴𝐵 ⊆ V) → (𝐴 × 𝐵) ⊆ (𝐴 × V))
118, 9, 10mp2an 426 . . . . . . 7 (𝐴 × 𝐵) ⊆ (𝐴 × V)
12 sslin 3389 . . . . . . 7 ((𝐴 × 𝐵) ⊆ (𝐴 × V) → (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶 ∩ (𝐴 × V)))
1311, 12ax-mp 5 . . . . . 6 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶 ∩ (𝐴 × V))
14 df-res 4675 . . . . . 6 (𝐶𝐴) = (𝐶 ∩ (𝐴 × V))
1513, 14sseqtrri 3218 . . . . 5 (𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶𝐴)
16 rnss 4896 . . . . 5 ((𝐶 ∩ (𝐴 × 𝐵)) ⊆ (𝐶𝐴) → ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴))
1715, 16ax-mp 5 . . . 4 ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴)
18 sstr 3191 . . . 4 ((𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ∧ ran (𝐶 ∩ (𝐴 × 𝐵)) ⊆ ran (𝐶𝐴)) → 𝐵 ⊆ ran (𝐶𝐴))
1917, 18mpan2 425 . . 3 (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) → 𝐵 ⊆ ran (𝐶𝐴))
20 ssel 3177 . . . . . . 7 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵𝑦 ∈ ran (𝐶𝐴)))
21 vex 2766 . . . . . . . 8 𝑦 ∈ V
2221elrn2 4908 . . . . . . 7 (𝑦 ∈ ran (𝐶𝐴) ↔ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴))
2320, 22imbitrdi 161 . . . . . 6 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵 → ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴)))
2423ancrd 326 . . . . 5 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵 → (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵)))
2521elrn2 4908 . . . . . 6 (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)))
26 elin 3346 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)))
27 opelxp 4693 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
2827anbi2i 457 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ (𝑥𝐴𝑦𝐵)))
2921opelres 4951 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶𝑥𝐴))
3029anbi1i 458 . . . . . . . . 9 ((⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵) ↔ ((⟨𝑥, 𝑦⟩ ∈ 𝐶𝑥𝐴) ∧ 𝑦𝐵))
31 anass 401 . . . . . . . . 9 (((⟨𝑥, 𝑦⟩ ∈ 𝐶𝑥𝐴) ∧ 𝑦𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ (𝑥𝐴𝑦𝐵)))
3230, 31bitr2i 185 . . . . . . . 8 ((⟨𝑥, 𝑦⟩ ∈ 𝐶 ∧ (𝑥𝐴𝑦𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3326, 28, 323bitri 206 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3433exbii 1619 . . . . . 6 (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥(⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
35 19.41v 1917 . . . . . 6 (∃𝑥(⟨𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵) ↔ (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3625, 34, 353bitri 206 . . . . 5 (𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ (∃𝑥𝑥, 𝑦⟩ ∈ (𝐶𝐴) ∧ 𝑦𝐵))
3724, 36imbitrrdi 162 . . . 4 (𝐵 ⊆ ran (𝐶𝐴) → (𝑦𝐵𝑦 ∈ ran (𝐶 ∩ (𝐴 × 𝐵))))
3837ssrdv 3189 . . 3 (𝐵 ⊆ ran (𝐶𝐴) → 𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)))
3919, 38impbii 126 . 2 (𝐵 ⊆ ran (𝐶 ∩ (𝐴 × 𝐵)) ↔ 𝐵 ⊆ ran (𝐶𝐴))
407, 39bitr2i 185 1 (𝐵 ⊆ ran (𝐶𝐴) ↔ ran (𝐶 ∩ (𝐴 × 𝐵)) = 𝐵)
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1364  wex 1506  wcel 2167  Vcvv 2763  cin 3156  wss 3157  cop 3625   × cxp 4661  ran crn 4664  cres 4665
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-br 4034  df-opab 4095  df-xp 4669  df-rel 4670  df-cnv 4671  df-dm 4673  df-rn 4674  df-res 4675
This theorem is referenced by:  rninxp  5113
  Copyright terms: Public domain W3C validator