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

Theorem iinon 8270
Description: The nonempty indexed intersection of a class of ordinal numbers 𝐵(𝑥) is an ordinal number. (Contributed by NM, 13-Oct-2003.) (Proof shortened by Mario Carneiro, 5-Dec-2016.)
Assertion
Ref Expression
iinon ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 ∈ On)
Distinct variable group:   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem iinon
StepHypRef Expression
1 dfiin3g 5911 . . 3 (∀𝑥𝐴 𝐵 ∈ On → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
21adantr 481 . 2 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
3 eqid 2739 . . . 4 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
43rnmptss 7064 . . 3 (∀𝑥𝐴 𝐵 ∈ On → ran (𝑥𝐴𝐵) ⊆ On)
5 dm0rn0 5866 . . . . . 6 (dom (𝑥𝐴𝐵) = ∅ ↔ ran (𝑥𝐴𝐵) = ∅)
6 dmmptg 6193 . . . . . . 7 (∀𝑥𝐴 𝐵 ∈ On → dom (𝑥𝐴𝐵) = 𝐴)
76eqeq1d 2741 . . . . . 6 (∀𝑥𝐴 𝐵 ∈ On → (dom (𝑥𝐴𝐵) = ∅ ↔ 𝐴 = ∅))
85, 7bitr3id 286 . . . . 5 (∀𝑥𝐴 𝐵 ∈ On → (ran (𝑥𝐴𝐵) = ∅ ↔ 𝐴 = ∅))
98necon3bid 2978 . . . 4 (∀𝑥𝐴 𝐵 ∈ On → (ran (𝑥𝐴𝐵) ≠ ∅ ↔ 𝐴 ≠ ∅))
109biimpar 478 . . 3 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥𝐴𝐵) ≠ ∅)
11 oninton 7738 . . 3 ((ran (𝑥𝐴𝐵) ⊆ On ∧ ran (𝑥𝐴𝐵) ≠ ∅) → ran (𝑥𝐴𝐵) ∈ On)
124, 10, 11syl2an2r 691 . 2 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥𝐴𝐵) ∈ On)
132, 12eqeltrd 2839 1 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 ∈ On)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  wne 2934  wral 3053  wss 3883  c0 4261   cint 4877   ciin 4922  cmpt 5153  dom cdm 5618  ran crn 5619  Oncon0 6310
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-sep 5218  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-int 4878  df-iin 4924  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-ord 6313  df-on 6314  df-fun 6487  df-fn 6488  df-f 6489
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator