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

Theorem foun 5590
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 5549 . . . 4 (𝐹:𝐴onto𝐵𝐹 Fn 𝐴)
2 fofn 5549 . . . 4 (𝐺:𝐶onto𝐷𝐺 Fn 𝐶)
31, 2anim12i 338 . . 3 ((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) → (𝐹 Fn 𝐴𝐺 Fn 𝐶))
4 fnun 5428 . . 3 (((𝐹 Fn 𝐴𝐺 Fn 𝐶) ∧ (𝐴𝐶) = ∅) → (𝐹𝐺) Fn (𝐴𝐶))
53, 4sylan 283 . 2 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → (𝐹𝐺) Fn (𝐴𝐶))
6 rnun 5136 . . 3 ran (𝐹𝐺) = (ran 𝐹 ∪ ran 𝐺)
7 forn 5550 . . . . 5 (𝐹:𝐴onto𝐵 → ran 𝐹 = 𝐵)
87ad2antrr 488 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → ran 𝐹 = 𝐵)
9 forn 5550 . . . . 5 (𝐺:𝐶onto𝐷 → ran 𝐺 = 𝐷)
109ad2antlr 489 . . . 4 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → ran 𝐺 = 𝐷)
118, 10uneq12d 3359 . . 3 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → (ran 𝐹 ∪ ran 𝐺) = (𝐵𝐷))
126, 11eqtrid 2274 . 2 (((𝐹:𝐴onto𝐵𝐺:𝐶onto𝐷) ∧ (𝐴𝐶) = ∅) → ran (𝐹𝐺) = (𝐵𝐷))
13 df-fo 5323 . 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 1395  cun 3195  cin 3196  c0 3491  ran crn 4719   Fn wfn 5312  ontowfo 5315
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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-14 2203  ax-ext 2211  ax-sep 4201  ax-pow 4257  ax-pr 4292
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-v 2801  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-br 4083  df-opab 4145  df-id 4383  df-rel 4725  df-cnv 4726  df-co 4727  df-dm 4728  df-rn 4729  df-fun 5319  df-fn 5320  df-f 5321  df-fo 5323
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator