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

Theorem ssrel 4714
Description: A subclass relationship depends only on a relation's ordered pairs. Theorem 3.2(i) of [Monk1] p. 33. (Contributed by NM, 2-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
ssrel (Rel 𝐴 → (𝐴𝐵 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem ssrel
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ssel 3149 . . 3 (𝐴𝐵 → (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
21alrimivv 1875 . 2 (𝐴𝐵 → ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵))
3 eleq1 2240 . . . . . . . . . . 11 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐴 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐴))
4 eleq1 2240 . . . . . . . . . . 11 (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐵 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
53, 4imbi12d 234 . . . . . . . . . 10 (𝑧 = ⟨𝑥, 𝑦⟩ → ((𝑧𝐴𝑧𝐵) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
65biimprcd 160 . . . . . . . . 9 ((⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → (𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐴𝑧𝐵)))
762alimi 1456 . . . . . . . 8 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → ∀𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐴𝑧𝐵)))
8 19.23vv 1884 . . . . . . . 8 (∀𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐴𝑧𝐵)) ↔ (∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐴𝑧𝐵)))
97, 8sylib 122 . . . . . . 7 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → (∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩ → (𝑧𝐴𝑧𝐵)))
109com23 78 . . . . . 6 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → (𝑧𝐴 → (∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩ → 𝑧𝐵)))
1110a2d 26 . . . . 5 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → ((𝑧𝐴 → ∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩) → (𝑧𝐴𝑧𝐵)))
1211alimdv 1879 . . . 4 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → (∀𝑧(𝑧𝐴 → ∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩) → ∀𝑧(𝑧𝐴𝑧𝐵)))
13 df-rel 4633 . . . . 5 (Rel 𝐴𝐴 ⊆ (V × V))
14 dfss2 3144 . . . . 5 (𝐴 ⊆ (V × V) ↔ ∀𝑧(𝑧𝐴𝑧 ∈ (V × V)))
15 elvv 4688 . . . . . . 7 (𝑧 ∈ (V × V) ↔ ∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩)
1615imbi2i 226 . . . . . 6 ((𝑧𝐴𝑧 ∈ (V × V)) ↔ (𝑧𝐴 → ∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩))
1716albii 1470 . . . . 5 (∀𝑧(𝑧𝐴𝑧 ∈ (V × V)) ↔ ∀𝑧(𝑧𝐴 → ∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩))
1813, 14, 173bitri 206 . . . 4 (Rel 𝐴 ↔ ∀𝑧(𝑧𝐴 → ∃𝑥𝑦 𝑧 = ⟨𝑥, 𝑦⟩))
19 dfss2 3144 . . . 4 (𝐴𝐵 ↔ ∀𝑧(𝑧𝐴𝑧𝐵))
2012, 18, 193imtr4g 205 . . 3 (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → (Rel 𝐴𝐴𝐵))
2120com12 30 . 2 (Rel 𝐴 → (∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵) → 𝐴𝐵))
222, 21impbid2 143 1 (Rel 𝐴 → (𝐴𝐵 ↔ ∀𝑥𝑦(⟨𝑥, 𝑦⟩ ∈ 𝐴 → ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105  wal 1351   = wceq 1353  wex 1492  wcel 2148  Vcvv 2737  wss 3129  cop 3595   × cxp 4624  Rel wrel 4631
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 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4121  ax-pow 4174  ax-pr 4209
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-opab 4065  df-xp 4632  df-rel 4633
This theorem is referenced by:  eqrel  4715  relssi  4717  relssdv  4718  cotr  5010  cnvsym  5012  intasym  5013  intirr  5015  codir  5017  qfto  5018
  Copyright terms: Public domain W3C validator