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

Theorem 2elresin 6040
 Description: Membership in two functions restricted by each other's domain. (Contributed by NM, 8-Aug-1994.)
Assertion
Ref Expression
2elresin ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)))))

Proof of Theorem 2elresin
StepHypRef Expression
1 fnop 6032 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) → 𝑥𝐴)
2 fnop 6032 . . . . . . . 8 ((𝐺 Fn 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) → 𝑥𝐵)
31, 2anim12i 589 . . . . . . 7 (((𝐹 Fn 𝐴 ∧ ⟨𝑥, 𝑦⟩ ∈ 𝐹) ∧ (𝐺 Fn 𝐵 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺)) → (𝑥𝐴𝑥𝐵))
43an4s 886 . . . . . 6 (((𝐹 Fn 𝐴𝐺 Fn 𝐵) ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺)) → (𝑥𝐴𝑥𝐵))
5 elin 3829 . . . . . 6 (𝑥 ∈ (𝐴𝐵) ↔ (𝑥𝐴𝑥𝐵))
64, 5sylibr 224 . . . . 5 (((𝐹 Fn 𝐴𝐺 Fn 𝐵) ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺)) → 𝑥 ∈ (𝐴𝐵))
7 vex 3234 . . . . . . . 8 𝑦 ∈ V
87opres 5441 . . . . . . 7 (𝑥 ∈ (𝐴𝐵) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐹))
9 vex 3234 . . . . . . . 8 𝑧 ∈ V
109opres 5441 . . . . . . 7 (𝑥 ∈ (𝐴𝐵) → (⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)) ↔ ⟨𝑥, 𝑧⟩ ∈ 𝐺))
118, 10anbi12d 747 . . . . . 6 (𝑥 ∈ (𝐴𝐵) → ((⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵))) ↔ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺)))
1211biimprd 238 . . . . 5 (𝑥 ∈ (𝐴𝐵) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)))))
136, 12syl 17 . . . 4 (((𝐹 Fn 𝐴𝐺 Fn 𝐵) ∧ (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺)) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)))))
1413ex 449 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵))))))
1514pm2.43d 53 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) → (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)))))
16 resss 5457 . . . 4 (𝐹 ↾ (𝐴𝐵)) ⊆ 𝐹
1716sseli 3632 . . 3 (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) → ⟨𝑥, 𝑦⟩ ∈ 𝐹)
18 resss 5457 . . . 4 (𝐺 ↾ (𝐴𝐵)) ⊆ 𝐺
1918sseli 3632 . . 3 (⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)) → ⟨𝑥, 𝑧⟩ ∈ 𝐺)
2017, 19anim12i 589 . 2 ((⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵))) → (⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺))
2115, 20impbid1 215 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((⟨𝑥, 𝑦⟩ ∈ 𝐹 ∧ ⟨𝑥, 𝑧⟩ ∈ 𝐺) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐹 ↾ (𝐴𝐵)) ∧ ⟨𝑥, 𝑧⟩ ∈ (𝐺 ↾ (𝐴𝐵)))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   ∈ wcel 2030   ∩ cin 3606  ⟨cop 4216   ↾ cres 5145   Fn wfn 5921 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-br 4686  df-opab 4746  df-xp 5149  df-rel 5150  df-dm 5153  df-res 5155  df-fun 5928  df-fn 5929 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator