| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iinon | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| iinon | ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfiin3g 5945 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 2 | 1 | adantr 484 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
| 3 | eqid 2762 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 4 | 3 | rnmptss 7104 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On) |
| 5 | dm0rn0 5900 | . . . . . 6 ⊢ (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅) | |
| 6 | dmmptg 6229 | . . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴) | |
| 7 | 6 | eqeq1d 2764 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅)) |
| 8 | 5, 7 | bitr3id 287 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅)) |
| 9 | 8 | necon3bid 3001 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅ ↔ 𝐴 ≠ ∅)) |
| 10 | 9 | biimpar 481 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅) |
| 11 | oninton 7778 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On) | |
| 12 | 4, 10, 11 | syl2an2r 695 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On) |
| 13 | 2, 12 | eqeltrd 2862 | 1 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 ∀wral 3076 ⊆ wss 3904 ∅c0 4285 ∩ cint 4905 ∩ ciin 4950 ↦ cmpt 5181 dom cdm 5647 ran crn 5648 Oncon0 6346 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iin 4952 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-ord 6349 df-on 6350 df-fun 6523 df-fn 6524 df-f 6525 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |