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

Theorem unixpm 5010
Description: The double class union of an inhabited cross product is the union of its members. (Contributed by Jim Kingdon, 18-Dec-2018.)
Assertion
Ref Expression
unixpm (∃𝑥 𝑥 ∈ (𝐴 × 𝐵) → (𝐴 × 𝐵) = (𝐴𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem unixpm
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relxp 4586 . . 3 Rel (𝐴 × 𝐵)
2 relfld 5003 . . 3 (Rel (𝐴 × 𝐵) → (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)))
31, 2ax-mp 7 . 2 (𝐴 × 𝐵) = (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵))
4 ancom 264 . . . 4 ((∃𝑏 𝑏𝐵 ∧ ∃𝑎 𝑎𝐴) ↔ (∃𝑎 𝑎𝐴 ∧ ∃𝑏 𝑏𝐵))
5 xpm 4896 . . . 4 ((∃𝑎 𝑎𝐴 ∧ ∃𝑏 𝑏𝐵) ↔ ∃𝑥 𝑥 ∈ (𝐴 × 𝐵))
64, 5bitri 183 . . 3 ((∃𝑏 𝑏𝐵 ∧ ∃𝑎 𝑎𝐴) ↔ ∃𝑥 𝑥 ∈ (𝐴 × 𝐵))
7 dmxpm 4697 . . . 4 (∃𝑏 𝑏𝐵 → dom (𝐴 × 𝐵) = 𝐴)
8 rnxpm 4904 . . . 4 (∃𝑎 𝑎𝐴 → ran (𝐴 × 𝐵) = 𝐵)
9 uneq12 3172 . . . 4 ((dom (𝐴 × 𝐵) = 𝐴 ∧ ran (𝐴 × 𝐵) = 𝐵) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴𝐵))
107, 8, 9syl2an 285 . . 3 ((∃𝑏 𝑏𝐵 ∧ ∃𝑎 𝑎𝐴) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴𝐵))
116, 10sylbir 134 . 2 (∃𝑥 𝑥 ∈ (𝐴 × 𝐵) → (dom (𝐴 × 𝐵) ∪ ran (𝐴 × 𝐵)) = (𝐴𝐵))
123, 11syl5eq 2144 1 (∃𝑥 𝑥 ∈ (𝐴 × 𝐵) → (𝐴 × 𝐵) = (𝐴𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1299  wex 1436  wcel 1448  cun 3019   cuni 3683   × cxp 4475  dom cdm 4477  ran crn 4478  Rel wrel 4482
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 671  ax-5 1391  ax-7 1392  ax-gen 1393  ax-ie1 1437  ax-ie2 1438  ax-8 1450  ax-10 1451  ax-11 1452  ax-i12 1453  ax-bndl 1454  ax-4 1455  ax-14 1460  ax-17 1474  ax-i9 1478  ax-ial 1482  ax-i5r 1483  ax-ext 2082  ax-sep 3986  ax-pow 4038  ax-pr 4069
This theorem depends on definitions:  df-bi 116  df-3an 932  df-tru 1302  df-nf 1405  df-sb 1704  df-eu 1963  df-mo 1964  df-clab 2087  df-cleq 2093  df-clel 2096  df-nfc 2229  df-ral 2380  df-rex 2381  df-v 2643  df-un 3025  df-in 3027  df-ss 3034  df-pw 3459  df-sn 3480  df-pr 3481  df-op 3483  df-uni 3684  df-br 3876  df-opab 3930  df-xp 4483  df-rel 4484  df-cnv 4485  df-dm 4487  df-rn 4488
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator