Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  founiiun Structured version   Visualization version   GIF version

Theorem founiiun 46528
Description: Union expressed as an indexed union, when a map onto is given. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Assertion
Ref Expression
founiiun (𝐹:𝐴⟶onto𝐵 → ∪ 𝐵 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹

Proof of Theorem founiiun
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 uniiun 5022 . 2 ∪ 𝐵 = ∪ 𝑦 ∈ 𝐵 𝑦
2 foelcdmi 6977 . . . . . 6 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦)
3 eqimss2 3972 . . . . . . 7 ((𝐹‘𝑥) = 𝑦 → 𝑦 ⊆ (𝐹‘𝑥))
43reximi 3104 . . . . . 6 (∃𝑥 ∈ 𝐴 (𝐹‘𝑥) = 𝑦 → ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥))
52, 4syl 18 . . . . 5 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥))
65ralrimiva 3158 . . . 4 (𝐹:𝐴⟶onto𝐵 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥))
7 iunss2 5013 . . . 4 (∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 ⊆ (𝐹‘𝑥) → ∪ 𝑦 ∈ 𝐵 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
86, 7syl 18 . . 3 (𝐹:𝐴⟶onto𝐵 → ∪ 𝑦 ∈ 𝐵 𝑦 ⊆ ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
9 fof 6826 . . . . . . 7 (𝐹:𝐴⟶onto𝐵 → 𝐹:𝐴⟶𝐵)
109ffvelcdmda 7116 . . . . . 6 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ∈ 𝐵)
11 ssidd 3936 . . . . . 6 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) ⊆ (𝐹‘𝑥))
12 sseq2 3939 . . . . . . 7 (𝑦 = (𝐹‘𝑥) → ((𝐹‘𝑥) ⊆ 𝑦 ↔ (𝐹‘𝑥) ⊆ (𝐹‘𝑥)))
1312rspcev 3580 . . . . . 6 (((𝐹‘𝑥) ∈ 𝐵 ∧ (𝐹‘𝑥) ⊆ (𝐹‘𝑥)) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
1410, 11, 13syl2anc 596 . . . . 5 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑥 ∈ 𝐴) → ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
1514ralrimiva 3158 . . . 4 (𝐹:𝐴⟶onto𝐵 → ∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦)
16 iunss2 5013 . . . 4 (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐹‘𝑥) ⊆ 𝑦 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
1715, 16syl 18 . . 3 (𝐹:𝐴⟶onto𝐵 → ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥) ⊆ ∪ 𝑦 ∈ 𝐵 𝑦)
188, 17eqssd 3930 . 2 (𝐹:𝐴⟶onto𝐵 → ∪ 𝑦 ∈ 𝐵 𝑦 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
191, 18eqtrid 2810 1 (𝐹:𝐴⟶onto𝐵 → ∪ 𝐵 = ∪ 𝑥 ∈ 𝐴 (𝐹‘𝑥))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090   ⊆ wss 3900  ∪ cuni 4872  ∪ ciun 4956  ⟶ontowfo 6564  ‘cfv 6566
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fo 6572  df-fv 6574
This theorem is used by:  founiiun0  46539  issalnnd  47689  caragenunicl  47868  isomenndlem  47874
  Copyright terms: Public domain W3C validator