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

Theorem smoiun 8407
Description: The value of a strictly monotone ordinal function contains its indexed union. (Contributed by Andrew Salmon, 22-Nov-2011.)
Assertion
Ref Expression
smoiun ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) ⊆ (𝐵‘𝐴))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem smoiun
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 eliun 4960 . . 3 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵‘𝑥))
2 smofvon 8405 . . . . 5 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐵‘𝐴) ∈ On)
3 smoel 8406 . . . . . 6 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐵‘𝑥) ∈ (𝐵‘𝐴))
433expia 1139 . . . . 5 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝑥 ∈ 𝐴 → (𝐵‘𝑥) ∈ (𝐵‘𝐴)))
5 ontr1 6436 . . . . . 6 ((𝐵‘𝐴) ∈ On → ((𝑦 ∈ (𝐵‘𝑥) ∧ (𝐵‘𝑥) ∈ (𝐵‘𝐴)) → 𝑦 ∈ (𝐵‘𝐴)))
65expcomd 422 . . . . 5 ((𝐵‘𝐴) ∈ On → ((𝐵‘𝑥) ∈ (𝐵‘𝐴) → (𝑦 ∈ (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴))))
72, 4, 6sylsyld 62 . . . 4 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝑥 ∈ 𝐴 → (𝑦 ∈ (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴))))
87rexlimdv 3165 . . 3 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴)))
91, 8biimtrid 245 . 2 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴)))
109ssrdv 3919 1 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) ⊆ (𝐵‘𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  ∃wrex 3090   ⊆ wss 3900  ∪ ciun 4956  dom cdm 5658  Oncon0 6388  ‘cfv 6566  Smo wsmo 8391
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-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-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-tr 5219  df-id 5553  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-ord 6391  df-on 6392  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-smo 8392
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator