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

Theorem iinon 8386
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 5963 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
21adantr 486 . 2 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
3 eqid 2763 . . . 4 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
43rnmptss 7155 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On)
5 dm0rn0 5918 . . . . . 6 (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅)
6 dmmptg 6262 . . . . . . 7 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴)
76eqeq1d 2765 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅))
85, 7bitr3id 288 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅))
98necon3bid 3003 . . . 4 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅ ↔ 𝐴 ≠ ∅))
109biimpar 483 . . 3 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅)
11 oninton 7843 . . 3 ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)
124, 10, 11syl2an2r 698 . 2 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)
132, 12eqeltrd 2864 1 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080   ⊆ wss 3900  ∅c0 4281  ∩ cint 4912  ∩ ciin 4957   ↦ cmpt 5192  dom cdm 5658  ran crn 5659  Oncon0 6388
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-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iin 4959  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  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-res 5670  df-ima 5671  df-ord 6391  df-on 6392  df-fun 6568  df-fn 6569  df-f 6570
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator