| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nodenselem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for nodense 28082. 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 28066 | . . . . . . 7 ⊢ <s Or No | |
| 4 | sonr 5588 | . . . . . . 7 ⊢ (( <s Or No ∧ 𝐴 ∈ No) → ¬ 𝐴 <s 𝐴) | |
| 5 | 3, 4 | mpan 703 | . . . . . 6 ⊢ (𝐴 ∈ No → ¬ 𝐴 <s 𝐴) |
| 6 | 5 | adantr 486 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → ¬ 𝐴 <s 𝐴) |
| 7 | breq2 5110 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 <s 𝐴 ↔ 𝐴 <s 𝐵)) | |
| 8 | 7 | notbid 321 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 <s 𝐴 ↔ ¬ 𝐴 <s 𝐵)) |
| 9 | 6, 8 | syl5ibcom 248 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 = 𝐵 → ¬ 𝐴 <s 𝐵)) |
| 10 | 9 | necon2ad 2974 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No) → (𝐴 <s 𝐵 → 𝐴 ≠ 𝐵)) |
| 11 | 10 | imp 412 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No) ∧ 𝐴 <s 𝐵) → 𝐴 ≠ 𝐵) |
| 12 | nosepon 28055 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐴 ≠ 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) | |
| 13 | 1, 2, 11, 12 | syl3anc 1399 | 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 1570 ∈ wcel 2147 ≠ wne 2959 {crab 3416 ∩ cint 4910 class class class wbr 5106 Or wor 5563 Oncon0 6383 ‘cfv 6561 Nocsur 28030 <s clts 28031 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-ord 6386 df-on 6387 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-fv 6569 df-1o 8507 df-2o 8508 df-no 28033 df-lts 28034 |
| This theorem is used by: nodenselem6 28079 nodense 28082 |
| Copyright terms: Public domain | W3C validator |