| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nodenselem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for nodense 28054. 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 779 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ 𝐴 <s 𝐵) → 𝐴 ∈ No) | |
| 2 | simplr 781 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ 𝐴 <s 𝐵) → 𝐵 ∈ No) | |
| 3 | ltsso 28038 | . . . . . . 7 ⊢ <s Or No | |
| 4 | sonr 5582 | . . . . . . 7 ⊢ (( <s Or No ∧ 𝐴 ∈ No) → ¬ 𝐴 <s 𝐴) | |
| 5 | 3, 4 | mpan 703 | . . . . . 6 ⊢ (𝐴 ∈ No → ¬ 𝐴 <s 𝐴) |
| 6 | 5 | adantr 486 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → ¬ 𝐴 <s 𝐴) |
| 7 | breq2 5106 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 <s 𝐴 ↔ 𝐴 <s 𝐵)) | |
| 8 | 7 | notbid 321 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 <s 𝐴 ↔ ¬ 𝐴 <s 𝐵)) |
| 9 | 6, 8 | syl5ibcom 248 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 = 𝐵 → ¬ 𝐴 <s 𝐵)) |
| 10 | 9 | necon2ad 2970 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 <s 𝐵 → 𝐴 ≠ 𝐵)) |
| 11 | 10 | imp 412 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ 𝐴 <s 𝐵) → 𝐴 ≠ 𝐵) |
| 12 | nosepon 28027 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐴 ≠ 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) | |
| 13 | 1, 2, 11, 12 | syl3anc 1398 | 1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ 𝐴 <s 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 {crab 3412 ∩ cint 4906 class class class wbr 5102 Or wor 5557 Oncon0 6362 ‘cfv 6538 Nocsur 28002 <s clts 28003 |
| 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-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| 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-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-ord 6365 df-on 6366 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-fv 6546 df-1o 8479 df-2o 8480 df-no 28005 df-lts 28006 |
| This theorem is used by: nodenselem6 28051 nodense 28054 |
| Copyright terms: Public domain | W3C validator |