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

Theorem foun 5633
Description: The union of two onto functions with disjoint domains is an onto function. (Contributed by Mario Carneiro, 22-Jun-2016.)
Assertion
Ref Expression
foun (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → (𝐹𝐺):(𝐴𝐶)–onto→(𝐵𝐷))

Proof of Theorem foun
StepHypRef Expression
1 fofn 5592 . . . 4 (𝐹:𝐴onto𝐵𝐹 Fn 𝐴)
2 fofn 5592 . . . 4 (𝐺:𝐶onto𝐷𝐺 Fn 𝐶)
31, 2anim12i 338 . . 3 ((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) → (𝐹 Fn 𝐴𝐺 Fn 𝐶))
4 fnun 5464 . . 3 (((𝐹 Fn 𝐴𝐺 Fn 𝐶) ∧ (𝐴𝐶) = ∅) → (𝐹𝐺) Fn (𝐴𝐶))
53, 4sylan 283 . 2 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → (𝐹𝐺) Fn (𝐴𝐶))
6 rnun 5171 . . 3 ran (𝐹𝐺) = (ran 𝐹 ∪ ran 𝐺)
7 forn 5593 . . . . 5 (𝐹:𝐴onto𝐵 → ran 𝐹 = 𝐵)
87ad2antrr 488 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → ran 𝐹 = 𝐵)
9 forn 5593 . . . . 5 (𝐺:𝐶onto𝐷 → ran 𝐺 = 𝐷)
109ad2antlr 489 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → ran 𝐺 = 𝐷)
118, 10uneq12d 3374 . . 3 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → (ran 𝐹 ∪ ran 𝐺) = (𝐵𝐷))
126, 11eqtrid 2277 . 2 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → ran (𝐹𝐺) = (𝐵𝐷))
13 df-fo 5358 . 2 ((𝐹𝐺):(𝐴𝐶)–onto→(𝐵𝐷) ↔ ((𝐹𝐺) Fn (𝐴𝐶) ∧ ran (𝐹𝐺) = (𝐵𝐷)))
145, 12, 13sylanbrc 417 1 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → (𝐹𝐺):(𝐴𝐶)–onto→(𝐵𝐷))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  cun 3209  cin 3210  c0 3508  ran crn 4750   Fn wfn 5347  ontowfo 5350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-v 2815  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-br 4110  df-opab 4172  df-id 4414  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-fun 5354  df-fn 5355  df-f 5356  df-fo 5358
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator