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

Theorem unen 7925
Description: Equinumerosity of union of disjoint sets. Theorem 4 of [Suppes] p. 92. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 26-Apr-2015.)
Assertion
Ref Expression
unen (((𝐴𝐵𝐶𝐷) ∧ ((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅)) → (𝐴𝐶) ≈ (𝐵𝐷))

Proof of Theorem unen
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bren 7850 . . 3 (𝐴𝐵 ↔ ∃𝑥 𝑥:𝐴1-1-onto𝐵)
2 bren 7850 . . 3 (𝐶𝐷 ↔ ∃𝑦 𝑦:𝐶1-1-onto𝐷)
3 eeanv 2170 . . . 4 (∃𝑥𝑦(𝑥:𝐴1-1-onto𝐵𝑦:𝐶1-1-onto𝐷) ↔ (∃𝑥 𝑥:𝐴1-1-onto𝐵 ∧ ∃𝑦 𝑦:𝐶1-1-onto𝐷))
4 vex 3176 . . . . . . . 8 𝑥 ∈ V
5 vex 3176 . . . . . . . 8 𝑦 ∈ V
64, 5unex 6854 . . . . . . 7 (𝑥𝑦) ∈ V
7 f1oun 6069 . . . . . . 7 (((𝑥:𝐴1-1-onto𝐵𝑦:𝐶1-1-onto𝐷) ∧ ((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅)) → (𝑥𝑦):(𝐴𝐶)–1-1-onto→(𝐵𝐷))
8 f1oen3g 7857 . . . . . . 7 (((𝑥𝑦) ∈ V ∧ (𝑥𝑦):(𝐴𝐶)–1-1-onto→(𝐵𝐷)) → (𝐴𝐶) ≈ (𝐵𝐷))
96, 7, 8sylancr 694 . . . . . 6 (((𝑥:𝐴1-1-onto𝐵𝑦:𝐶1-1-onto𝐷) ∧ ((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅)) → (𝐴𝐶) ≈ (𝐵𝐷))
109ex 449 . . . . 5 ((𝑥:𝐴1-1-onto𝐵𝑦:𝐶1-1-onto𝐷) → (((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅) → (𝐴𝐶) ≈ (𝐵𝐷)))
1110exlimivv 1847 . . . 4 (∃𝑥𝑦(𝑥:𝐴1-1-onto𝐵𝑦:𝐶1-1-onto𝐷) → (((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅) → (𝐴𝐶) ≈ (𝐵𝐷)))
123, 11sylbir 224 . . 3 ((∃𝑥 𝑥:𝐴1-1-onto𝐵 ∧ ∃𝑦 𝑦:𝐶1-1-onto𝐷) → (((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅) → (𝐴𝐶) ≈ (𝐵𝐷)))
131, 2, 12syl2anb 495 . 2 ((𝐴𝐵𝐶𝐷) → (((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅) → (𝐴𝐶) ≈ (𝐵𝐷)))
1413imp 444 1 (((𝐴𝐵𝐶𝐷) ∧ ((𝐴𝐶) = ∅ ∧ (𝐵𝐷) = ∅)) → (𝐴𝐶) ≈ (𝐵𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wex 1695  wcel 1977  Vcvv 3173  cun 3538  cin 3539  c0 3874   class class class wbr 4583  1-1-ontowf1o 5803  cen 7838
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-en 7842
This theorem is referenced by:  difsnen  7927  undom  7933  limensuci  8021  infensuc  8023  phplem2  8025  pssnn  8063  dif1en  8078  unfi  8112  infdifsn  8437  pm54.43  8709  dif1card  8716  cdaun  8877  cdaen  8878  ssfin4  9015  fin23lem26  9030  unsnen  9254  fzennn  12629  mreexexlem4d  16130
  Copyright terms: Public domain W3C validator