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

Theorem iinon 8356
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 5952 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
21adantr 486 . 2 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵))
3 eqid 2760 . . . 4 (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵)
43rnmptss 7128 . . 3 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On)
5 dm0rn0 5907 . . . . . 6 (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅)
6 dmmptg 6246 . . . . . . 7 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴)
76eqeq1d 2762 . . . . . 6 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅))
85, 7bitr3id 288 . . . . 5 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅))
98necon3bid 2999 . . . 4 (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅ ↔ 𝐴 ≠ ∅))
109biimpar 483 . . 3 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅)
11 oninton 7813 . . 3 ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)
124, 10, 11syl2an2r 698 . 2 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On)
132, 12eqeltrd 2860 1 ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ On)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076   ⊆ wss 3896  ∅c0 4277  ∩ cint 4906  ∩ ciin 4951   ↦ cmpt 5185  dom cdm 5651  ran crn 5652  Oncon0 6365
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-ord 6368  df-on 6369  df-fun 6545  df-fn 6546  df-f 6547
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator