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

Theorem elmpt2cl 5698
Description: If a two-parameter class is not empty, constrain the implicit pair. (Contributed by Stefan O'Rear, 7-Mar-2015.)
Hypothesis
Ref Expression
elmpt2cl.f 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
Assertion
Ref Expression
elmpt2cl (𝑋 ∈ (𝑆𝐹𝑇) → (𝑆𝐴𝑇𝐵))
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦
Allowed substitution hints:   𝐶(𝑥,𝑦)   𝑆(𝑥,𝑦)   𝑇(𝑥,𝑦)   𝐹(𝑥,𝑦)   𝑋(𝑥,𝑦)

Proof of Theorem elmpt2cl
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 elmpt2cl.f . . . . . 6 𝐹 = (𝑥𝐴, 𝑦𝐵𝐶)
2 df-mpt2 5517 . . . . . 6 (𝑥𝐴, 𝑦𝐵𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
31, 2eqtri 2060 . . . . 5 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
43dmeqi 4536 . . . 4 dom 𝐹 = dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
5 dmoprabss 5586 . . . 4 dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)} ⊆ (𝐴 × 𝐵)
64, 5eqsstri 2975 . . 3 dom 𝐹 ⊆ (𝐴 × 𝐵)
71mpt2fun 5603 . . . . . 6 Fun 𝐹
8 funrel 4919 . . . . . 6 (Fun 𝐹 → Rel 𝐹)
97, 8ax-mp 7 . . . . 5 Rel 𝐹
10 relelfvdm 5205 . . . . 5 ((Rel 𝐹𝑋 ∈ (𝐹‘⟨𝑆, 𝑇⟩)) → ⟨𝑆, 𝑇⟩ ∈ dom 𝐹)
119, 10mpan 400 . . . 4 (𝑋 ∈ (𝐹‘⟨𝑆, 𝑇⟩) → ⟨𝑆, 𝑇⟩ ∈ dom 𝐹)
12 df-ov 5515 . . . 4 (𝑆𝐹𝑇) = (𝐹‘⟨𝑆, 𝑇⟩)
1311, 12eleq2s 2132 . . 3 (𝑋 ∈ (𝑆𝐹𝑇) → ⟨𝑆, 𝑇⟩ ∈ dom 𝐹)
146, 13sseldi 2943 . 2 (𝑋 ∈ (𝑆𝐹𝑇) → ⟨𝑆, 𝑇⟩ ∈ (𝐴 × 𝐵))
15 opelxp 4374 . 2 (⟨𝑆, 𝑇⟩ ∈ (𝐴 × 𝐵) ↔ (𝑆𝐴𝑇𝐵))
1614, 15sylib 127 1 (𝑋 ∈ (𝑆𝐹𝑇) → (𝑆𝐴𝑇𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97   = wceq 1243  wcel 1393  cop 3378   × cxp 4343  dom cdm 4345  Rel wrel 4350  Fun wfun 4896  cfv 4902  (class class class)co 5512  {coprab 5513  cmpt2 5514
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-sep 3875  ax-pow 3927  ax-pr 3944
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ral 2311  df-rex 2312  df-v 2559  df-un 2922  df-in 2924  df-ss 2931  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-br 3765  df-opab 3819  df-id 4030  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-iota 4867  df-fun 4904  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517
This theorem is referenced by:  elmpt2cl1  5699  elmpt2cl2  5700  elovmpt2  5701  ixxssxr  8769  elixx3g  8770  ixxssixx  8771  eliooxr  8796  elfz2  8881
  Copyright terms: Public domain W3C validator