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

Theorem elmpt2cl 5718
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 5537 . . . . . 6 (𝑥𝐴, 𝑦𝐵𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
31, 2eqtri 2101 . . . . 5 𝐹 = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
43dmeqi 4554 . . . 4 dom 𝐹 = dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)}
5 dmoprabss 5606 . . . 4 dom {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ 𝑧 = 𝐶)} ⊆ (𝐴 × 𝐵)
64, 5eqsstri 3029 . . 3 dom 𝐹 ⊆ (𝐴 × 𝐵)
71mpt2fun 5623 . . . . . 6 Fun 𝐹
8 funrel 4939 . . . . . 6 (Fun 𝐹 → Rel 𝐹)
97, 8ax-mp 7 . . . . 5 Rel 𝐹
10 relelfvdm 5226 . . . . 5 ((Rel 𝐹𝑋 ∈ (𝐹‘⟨𝑆, 𝑇⟩)) → ⟨𝑆, 𝑇⟩ ∈ dom 𝐹)
119, 10mpan 414 . . . 4 (𝑋 ∈ (𝐹‘⟨𝑆, 𝑇⟩) → ⟨𝑆, 𝑇⟩ ∈ dom 𝐹)
12 df-ov 5535 . . . 4 (𝑆𝐹𝑇) = (𝐹‘⟨𝑆, 𝑇⟩)
1311, 12eleq2s 2173 . . 3 (𝑋 ∈ (𝑆𝐹𝑇) → ⟨𝑆, 𝑇⟩ ∈ dom 𝐹)
146, 13sseldi 2997 . 2 (𝑋 ∈ (𝑆𝐹𝑇) → ⟨𝑆, 𝑇⟩ ∈ (𝐴 × 𝐵))
15 opelxp 4392 . 2 (⟨𝑆, 𝑇⟩ ∈ (𝐴 × 𝐵) ↔ (𝑆𝐴𝑇𝐵))
1614, 15sylib 120 1 (𝑋 ∈ (𝑆𝐹𝑇) → (𝑆𝐴𝑇𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102   = wceq 1284  wcel 1433  cop 3401   × cxp 4361  dom cdm 4363  Rel wrel 4368  Fun wfun 4916  cfv 4922  (class class class)co 5532  {coprab 5533  cmpt2 5534
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-iota 4887  df-fun 4924  df-fv 4930  df-ov 5535  df-oprab 5536  df-mpt2 5537
This theorem is referenced by:  elmpt2cl1  5719  elmpt2cl2  5720  elovmpt2  5721  ixxssxr  8923  elixx3g  8924  ixxssixx  8925  eliooxr  8950  elfz2  9036
  Copyright terms: Public domain W3C validator