Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ordn2lp | Structured version Visualization version GIF version |
Description: An ordinal class cannot be an element of one of its members. Variant of first part of Theorem 2.2(vii) of [BellMachover] p. 469. (Contributed by NM, 3-Apr-1994.) |
Ref | Expression |
---|---|
ordn2lp | ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ordirr 6203 | . 2 ⊢ (Ord 𝐴 → ¬ 𝐴 ∈ 𝐴) | |
2 | ordtr 6199 | . . 3 ⊢ (Ord 𝐴 → Tr 𝐴) | |
3 | trel 5171 | . . 3 ⊢ (Tr 𝐴 → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐴 ∈ 𝐴)) | |
4 | 2, 3 | syl 17 | . 2 ⊢ (Ord 𝐴 → ((𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴) → 𝐴 ∈ 𝐴)) |
5 | 1, 4 | mtod 200 | 1 ⊢ (Ord 𝐴 → ¬ (𝐴 ∈ 𝐵 ∧ 𝐵 ∈ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∈ wcel 2110 Tr wtr 5164 Ord word 6184 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-tr 5165 df-eprel 5459 df-fr 5508 df-we 5510 df-ord 6188 |
This theorem is referenced by: ordtri1 6218 ordnbtwn 6275 suc11 6288 smoord 7996 unblem1 8764 cantnfp1lem3 9137 cardprclem 9402 nosepssdm 33185 slerec 33272 |
Copyright terms: Public domain | W3C validator |