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

Theorem iinon 8171
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 5874 . . 3 (∀𝑥𝐴 𝐵 ∈ On → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
21adantr 481 . 2 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 = ran (𝑥𝐴𝐵))
3 eqid 2738 . . . 4 (𝑥𝐴𝐵) = (𝑥𝐴𝐵)
43rnmptss 6996 . . 3 (∀𝑥𝐴 𝐵 ∈ On → ran (𝑥𝐴𝐵) ⊆ On)
5 dm0rn0 5834 . . . . . 6 (dom (𝑥𝐴𝐵) = ∅ ↔ ran (𝑥𝐴𝐵) = ∅)
6 dmmptg 6145 . . . . . . 7 (∀𝑥𝐴 𝐵 ∈ On → dom (𝑥𝐴𝐵) = 𝐴)
76eqeq1d 2740 . . . . . 6 (∀𝑥𝐴 𝐵 ∈ On → (dom (𝑥𝐴𝐵) = ∅ ↔ 𝐴 = ∅))
85, 7bitr3id 285 . . . . 5 (∀𝑥𝐴 𝐵 ∈ On → (ran (𝑥𝐴𝐵) = ∅ ↔ 𝐴 = ∅))
98necon3bid 2988 . . . 4 (∀𝑥𝐴 𝐵 ∈ On → (ran (𝑥𝐴𝐵) ≠ ∅ ↔ 𝐴 ≠ ∅))
109biimpar 478 . . 3 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥𝐴𝐵) ≠ ∅)
11 oninton 7645 . . 3 ((ran (𝑥𝐴𝐵) ⊆ On ∧ ran (𝑥𝐴𝐵) ≠ ∅) → ran (𝑥𝐴𝐵) ∈ On)
124, 10, 11syl2an2r 682 . 2 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥𝐴𝐵) ∈ On)
132, 12eqeltrd 2839 1 ((∀𝑥𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → 𝑥𝐴 𝐵 ∈ On)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  wne 2943  wral 3064  wss 3887  c0 4256   cint 4879   ciin 4925  cmpt 5157  dom cdm 5589  ran crn 5590  Oncon0 6266
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-ord 6269  df-on 6270  df-fun 6435  df-fn 6436  df-f 6437
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator