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

Theorem dmxpss2 5194
Description: Upper bound for the domain of a binary relation. (Contributed by BJ, 10-Jul-2022.)
Assertion
Ref Expression
dmxpss2 (𝑅 ⊆ (𝐴 × 𝐵) → dom 𝑅𝐴)

Proof of Theorem dmxpss2
StepHypRef Expression
1 dmss 4954 . 2 (𝑅 ⊆ (𝐴 × 𝐵) → dom 𝑅 ⊆ dom (𝐴 × 𝐵))
2 dmxpss 5192 . 2 dom (𝐴 × 𝐵) ⊆ 𝐴
31, 2sstrdi 3249 1 (𝑅 ⊆ (𝐴 × 𝐵) → dom 𝑅𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wss 3210   × cxp 4746  dom cdm 4748
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-br 4109  df-opab 4171  df-xp 4754  df-dm 4758
This theorem is referenced by:  cossxp2  5285
  Copyright terms: Public domain W3C validator