| 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 5918 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) | |
| 2 | 1 | adantr 480 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵)) |
| 3 | eqid 2737 | . . . 4 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐵) | |
| 4 | 3 | rnmptss 7069 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On) |
| 5 | dm0rn0 5873 | . . . . . 6 ⊢ (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅) | |
| 6 | dmmptg 6200 | . . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → dom (𝑥 ∈ 𝐴 ↦ 𝐵) = 𝐴) | |
| 7 | 6 | eqeq1d 2739 | . . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (dom (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅)) |
| 8 | 5, 7 | bitr3id 285 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) = ∅ ↔ 𝐴 = ∅)) |
| 9 | 8 | necon3bid 2977 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ∈ On → (ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅ ↔ 𝐴 ≠ ∅)) |
| 10 | 9 | biimpar 477 | . . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅) |
| 11 | oninton 7742 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐴 ↦ 𝐵) ⊆ On ∧ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On) | |
| 12 | 4, 10, 11 | syl2an2r 686 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ ran (𝑥 ∈ 𝐴 ↦ 𝐵) ∈ On) |
| 13 | 2, 12 | eqeltrd 2837 | 1 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ∈ On ∧ 𝐴 ≠ ∅) → ∩ 𝑥 ∈ 𝐴 𝐵 ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ∀wral 3052 ⊆ wss 3890 ∅c0 4274 ∩ cint 4890 ∩ ciin 4935 ↦ cmpt 5167 dom cdm 5624 ran crn 5625 Oncon0 6317 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-int 4891 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-ord 6320 df-on 6321 df-fun 6494 df-fn 6495 df-f 6496 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |