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

Theorem elres 5094
Description: Membership in a restriction. (Contributed by Scott Fenton, 17-Mar-2011.)
Assertion
Ref Expression
elres (𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦

Proof of Theorem elres
StepHypRef Expression
1 relres 5086 . . . . 5 Rel (𝐵𝐶)
2 elrel 4872 . . . . 5 ((Rel (𝐵𝐶) ∧ 𝐴 ∈ (𝐵𝐶)) → ∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
31, 2mpan 428 . . . 4 (𝐴 ∈ (𝐵𝐶) → ∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩)
4 eleq1 2301 . . . . . . . . 9 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ (𝐵𝐶) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶)))
54biimpd 144 . . . . . . . 8 (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 ∈ (𝐵𝐶) → ⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶)))
6 vex 2824 . . . . . . . . . . 11 𝑦 ∈ V
76opelres 5063 . . . . . . . . . 10 (⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐵𝑥𝐶))
87biimpi 120 . . . . . . . . 9 (⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶) → (⟨𝑥, 𝑦⟩ ∈ 𝐵𝑥𝐶))
98ancomd 267 . . . . . . . 8 (⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶) → (𝑥𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
105, 9syl6com 35 . . . . . . 7 (𝐴 ∈ (𝐵𝐶) → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝑥𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
1110ancld 325 . . . . . 6 (𝐴 ∈ (𝐵𝐶) → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))))
12 an12 567 . . . . . 6 ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥𝐶 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)) ↔ (𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
1311, 12imbitrdi 161 . . . . 5 (𝐴 ∈ (𝐵𝐶) → (𝐴 = ⟨𝑥, 𝑦⟩ → (𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))))
14132eximdv 1935 . . . 4 (𝐴 ∈ (𝐵𝐶) → (∃𝑥𝑦 𝐴 = ⟨𝑥, 𝑦⟩ → ∃𝑥𝑦(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))))
153, 14mpd 13 . . 3 (𝐴 ∈ (𝐵𝐶) → ∃𝑥𝑦(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
16 rexcom4 2845 . . . 4 (∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) ↔ ∃𝑦𝑥𝐶 (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
17 df-rex 2534 . . . . 5 (∃𝑥𝐶 (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) ↔ ∃𝑥(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
1817exbii 1658 . . . 4 (∃𝑦𝑥𝐶 (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) ↔ ∃𝑦𝑥(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
19 excom 1716 . . . 4 (∃𝑦𝑥(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)) ↔ ∃𝑥𝑦(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
2016, 18, 193bitri 206 . . 3 (∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) ↔ ∃𝑥𝑦(𝑥𝐶 ∧ (𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵)))
2115, 20sylibr 134 . 2 (𝐴 ∈ (𝐵𝐶) → ∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
227simplbi2com 1494 . . . . . 6 (𝑥𝐶 → (⟨𝑥, 𝑦⟩ ∈ 𝐵 → ⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶)))
234biimprd 158 . . . . . 6 (𝐴 = ⟨𝑥, 𝑦⟩ → (⟨𝑥, 𝑦⟩ ∈ (𝐵𝐶) → 𝐴 ∈ (𝐵𝐶)))
2422, 23syl9 72 . . . . 5 (𝑥𝐶 → (𝐴 = ⟨𝑥, 𝑦⟩ → (⟨𝑥, 𝑦⟩ ∈ 𝐵𝐴 ∈ (𝐵𝐶))))
2524impd 254 . . . 4 (𝑥𝐶 → ((𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) → 𝐴 ∈ (𝐵𝐶)))
2625exlimdv 1872 . . 3 (𝑥𝐶 → (∃𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) → 𝐴 ∈ (𝐵𝐶)))
2726rexlimiv 2662 . 2 (∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵) → 𝐴 ∈ (𝐵𝐶))
2821, 27impbii 126 1 (𝐴 ∈ (𝐵𝐶) ↔ ∃𝑥𝐶𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐵))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1402  wex 1545  wcel 2209  wrex 2529  cop 3708  cres 4771  Rel wrel 4774
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 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4244  ax-pow 4306  ax-pr 4341
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3687  df-sn 3711  df-pr 3712  df-op 3714  df-opab 4188  df-xp 4775  df-rel 4776  df-res 4781
This theorem is referenced by:  elsnres  5095
  Copyright terms: Public domain W3C validator