Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > epelon2 | Structured version Visualization version GIF version |
Description: Over the ordinal numbers, one may define the relation 𝐴 E 𝐵 iff 𝐴 ∈ 𝐵 and one finds that, under this ordering, On is a well-ordered class, see epweon 7538. This is a weak form of epelg 5446 which only requires that we know 𝐵 to be a set. (Contributed by RP, 27-Sep-2023.) |
Ref | Expression |
---|---|
epelon2 | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | epelg 5446 | . 2 ⊢ (𝐵 ∈ On → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
2 | 1 | adantl 485 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 E 𝐵 ↔ 𝐴 ∈ 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∈ wcel 2112 class class class wbr 5039 E cep 5444 Oncon0 6191 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-8 2114 ax-9 2122 ax-ext 2708 ax-sep 5177 ax-nul 5184 ax-pr 5307 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 848 df-3an 1091 df-tru 1546 df-fal 1556 df-ex 1788 df-sb 2073 df-clab 2715 df-cleq 2728 df-clel 2809 df-ne 2933 df-rab 3060 df-v 3400 df-dif 3856 df-un 3858 df-nul 4224 df-if 4426 df-sn 4528 df-pr 4530 df-op 4534 df-br 5040 df-opab 5102 df-eprel 5445 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |