| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nodenselem4 | Structured version Visualization version GIF version | ||
| Description: Lemma for nodense 27834. 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 778 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐴 ∈ No ) | |
| 2 | simplr 780 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐵 ∈ No ) | |
| 3 | ltsso 27818 | . . . . . . 7 ⊢ <s Or No | |
| 4 | sonr 5595 | . . . . . . 7 ⊢ (( <s Or No ∧ 𝐴 ∈ No ) → ¬ 𝐴 <s 𝐴) | |
| 5 | 3, 4 | mpan 702 | . . . . . 6 ⊢ (𝐴 ∈ No → ¬ 𝐴 <s 𝐴) |
| 6 | 5 | adantr 485 | . . . . 5 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → ¬ 𝐴 <s 𝐴) |
| 7 | breq2 5114 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 <s 𝐴 ↔ 𝐴 <s 𝐵)) | |
| 8 | 7 | notbid 321 | . . . . 5 ⊢ (𝐴 = 𝐵 → (¬ 𝐴 <s 𝐴 ↔ ¬ 𝐴 <s 𝐵)) |
| 9 | 6, 8 | syl5ibcom 248 | . . . 4 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 = 𝐵 → ¬ 𝐴 <s 𝐵)) |
| 10 | 9 | necon2ad 2973 | . . 3 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ) → (𝐴 <s 𝐵 → 𝐴 ≠ 𝐵)) |
| 11 | 10 | imp 411 | . 2 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → 𝐴 ≠ 𝐵) |
| 12 | nosepon 27807 | . 2 ⊢ ((𝐴 ∈ No ∧ 𝐵 ∈ No ∧ 𝐴 ≠ 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) | |
| 13 | 1, 2, 11, 12 | syl3anc 1398 | 1 ⊢ (((𝐴 ∈ No ∧ 𝐵 ∈ No ) ∧ 𝐴 <s 𝐵) → ∩ {𝑎 ∈ On ∣ (𝐴‘𝑎) ≠ (𝐵‘𝑎)} ∈ On) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 {crab 3416 ∩ cint 4913 class class class wbr 5110 Or wor 5570 Oncon0 6362 ‘cfv 6538 No csur 27782 <s clts 27783 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-uni 4874 df-int 4914 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 8454 df-2o 8455 df-no 27785 df-lts 27786 |
| This theorem is referenced by: nodenselem6 27831 nodense 27834 |
| Copyright terms: Public domain | W3C validator |