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

Theorem smoiun 6576
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 4016 . . 3 (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵‘𝑥))
2 smofvon 6574 . . . . 5 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝐵‘𝐴) ∈ On)
3 smoel 6575 . . . . . 6 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐵‘𝑥) ∈ (𝐵‘𝐴))
433expia 1236 . . . . 5 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝑥 ∈ 𝐴 → (𝐵‘𝑥) ∈ (𝐵‘𝐴)))
5 ontr1 4536 . . . . . 6 ((𝐵‘𝐴) ∈ On → ((𝑦 ∈ (𝐵‘𝑥) ∧ (𝐵‘𝑥) ∈ (𝐵‘𝐴)) → 𝑦 ∈ (𝐵‘𝐴)))
65expcomd 1491 . . . . 5 ((𝐵‘𝐴) ∈ On → ((𝐵‘𝑥) ∈ (𝐵‘𝐴) → (𝑦 ∈ (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴))))
72, 4, 6sylsyld 58 . . . 4 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝑥 ∈ 𝐴 → (𝑦 ∈ (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴))))
87rexlimdv 2667 . . 3 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (∃𝑥 ∈ 𝐴 𝑦 ∈ (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴)))
91, 8biimtrid 152 . 2 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) → 𝑦 ∈ (𝐵‘𝐴)))
109ssrdv 3254 1 ((Smo 𝐵 ∧ 𝐴 ∈ dom 𝐵) → ∪ 𝑥 ∈ 𝐴 (𝐵‘𝑥) ⊆ (𝐵‘𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∈ wcel 2209  ∃wrex 2529   ⊆ wss 3220  ∪ ciun 4012  Oncon0 4510  dom cdm 4776  ‘cfv 5380  Smo wsmo 6560
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-iun 4014  df-br 4132  df-opab 4194  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-smo 6561
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator