| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nodenselem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for nodense 27604. Show that a particular abstraction is an ordinal. (Contributed by Scott Fenton, 16-Jun-2011.) |
| Ref | Expression |
|---|---|
| nodenselem4 | ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 766 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐴 ∈ No ) | |
| 2 | simplr 768 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐵 ∈ No ) | |
| 3 | sltso 27588 | . . . . . . 7 ⊢ <s Or No | |
| 4 | sonr 5570 | . . . . . . 7 ⊢ (( <s Or No ∧ 𝐴 ∈ No ) → ¬ 𝐴 <s 𝐴) | |
| 5 | 3, 4 | mpan 690 | . . . . . 6 ⊢ (𝐴 ∈ No → ¬ 𝐴 <s 𝐴) |
| 6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → ¬ 𝐴 <s 𝐴) |
| 7 | breq2 5111 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 <s 𝐴 ↔ 𝐴 <s 𝐵)) | |
| 8 | 7 | notbid 318 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 <s 𝐴 ↔ ¬ 𝐴 <s 𝐵)) |
| 9 | 6, 8 | syl5ibcom 245 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 = 𝐵 → ¬ 𝐴 <s 𝐵)) |
| 10 | 9 | necon2ad 2940 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 → 𝐴 ≠ 𝐵)) |
| 11 | 10 | imp 406 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐴 ≠ 𝐵) |
| 12 | nosepon 27577 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐴 ≠ 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) | |
| 13 | 1, 2, 11, 12 | syl3anc 1373 | 1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 {crab 3405 ∩ cint 4910 class class class wbr 5107 Or wor 5545 Oncon0 6332 ‘cfv 6511 No csur 27551 <s cslt 27552 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-ord 6335 df-on 6336 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-fv 6519 df-1o 8434 df-2o 8435 df-no 27554 df-slt 27555 |
| This theorem is referenced by: nodenselem6 27601 nodense 27604 |
| Copyright terms: Public domain | W3C validator |