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

Theorem ssrel2 5735
Description: A subclass relationship depends only on a relation's ordered pairs. This version of ssrel 5733 is restricted to the relation's domain. (Contributed by Thierry Arnoux, 25-Jan-2018.)
Assertion
Ref Expression
ssrel2 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑅𝑆 ↔ ∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦   𝑥,𝑆,𝑦

Proof of Theorem ssrel2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ssel 3916 . . . 4 (𝑅𝑆 → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆))
21a1d 25 . . 3 (𝑅𝑆 → ((𝑥𝐴𝑦𝐵) → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))
32ralrimivv 3181 . 2 (𝑅𝑆 → ∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆))
4 eleq1 2828 . . . . . . . . . . 11 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
5 eleq1 2828 . . . . . . . . . . 11 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑆 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝑆))
64, 5imbi12d 345 . . . . . . . . . 10 (𝑧 = ⟨𝑥, 𝑦⟩ → ((𝑧𝑅𝑧𝑆) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))
76biimprcd 251 . . . . . . . . 9 ((⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
872ralimi 3110 . . . . . . . 8 (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → ∀𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
9 r19.23v 3167 . . . . . . . . . 10 (∀𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)) ↔ (∃𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
109ralbii 3086 . . . . . . . . 9 (∀𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)) ↔ ∀𝑥𝐴 (∃𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
11 r19.23v 3167 . . . . . . . . 9 (∀𝑥𝐴 (∃𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)) ↔ (∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
1210, 11bitri 276 . . . . . . . 8 (∀𝑥𝐴𝑦𝐵 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)) ↔ (∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
138, 12sylib 219 . . . . . . 7 (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝑅𝑧𝑆)))
1413com23 86 . . . . . 6 (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (𝑧𝑅 → (∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩ → 𝑧𝑆)))
1514a2d 29 . . . . 5 (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → ((𝑧𝑅 → ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑧𝑅𝑧𝑆)))
1615alimdv 1923 . . . 4 (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (∀𝑧(𝑧𝑅 → ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩) → ∀𝑧(𝑧𝑅𝑧𝑆)))
17 df-ss 3907 . . . . 5 (𝑅 ⊆ (𝐴 × 𝐵) ↔ ∀𝑧(𝑧𝑅𝑧 ∈ (𝐴 × 𝐵)))
18 elxp2 5649 . . . . . . 7 (𝑧 ∈ (𝐴 × 𝐵) ↔ ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩)
1918imbi2i 337 . . . . . 6 ((𝑧𝑅𝑧 ∈ (𝐴 × 𝐵)) ↔ (𝑧𝑅 → ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩))
2019albii 1826 . . . . 5 (∀𝑧(𝑧𝑅𝑧 ∈ (𝐴 × 𝐵)) ↔ ∀𝑧(𝑧𝑅 → ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩))
2117, 20bitri 276 . . . 4 (𝑅 ⊆ (𝐴 × 𝐵) ↔ ∀𝑧(𝑧𝑅 → ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑥, 𝑦⟩))
22 df-ss 3907 . . . 4 (𝑅𝑆 ↔ ∀𝑧(𝑧𝑅𝑧𝑆))
2316, 21, 223imtr4g 297 . . 3 (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → (𝑅 ⊆ (𝐴 × 𝐵) → 𝑅𝑆))
2423com12 32 . 2 (𝑅 ⊆ (𝐴 × 𝐵) → (∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆) → 𝑅𝑆))
253, 24impbid2 227 1 (𝑅 ⊆ (𝐴 × 𝐵) → (𝑅𝑆 ↔ ∀𝑥𝐴𝑦𝐵 (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ 𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  wal 1545   = wceq 1547  wcel 2119  wral 3054  wrex 3064  wss 3890  cop 4568   × cxp 5623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-un 3895  df-in 3897  df-ss 3907  df-sn 4563  df-pr 4565  df-op 4569  df-opab 5142  df-xp 5631
This theorem is referenced by:  metuel2  24555  isarchi  33270
  Copyright terms: Public domain W3C validator