| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > domtri2 | Structured version Visualization version GIF version | ||
| Description: Trichotomy of dominance for numerable sets (does not use AC). (Contributed by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| domtri2 | ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | carddom2 9892 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ 𝐴 ≼ 𝐵)) | |
| 2 | cardon 9859 | . . . 4 ⊢ (card‘𝐴) ∈ On | |
| 3 | cardon 9859 | . . . 4 ⊢ (card‘𝐵) ∈ On | |
| 4 | ontri1 6344 | . . . 4 ⊢ (((card‘𝐴) ∈ On ∧ (card‘𝐵) ∈ On) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴))) | |
| 5 | 2, 3, 4 | mp2an 698 | . . 3 ⊢ ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ (card‘𝐵) ∈ (card‘𝐴)) |
| 6 | cardsdom2 9903 | . . . . 5 ⊢ ((𝐵 ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘𝐵) ∈ (card‘𝐴) ↔ 𝐵 ≺ 𝐴)) | |
| 7 | 6 | ancoms 459 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐵) ∈ (card‘𝐴) ↔ 𝐵 ≺ 𝐴)) |
| 8 | 7 | notbid 319 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (¬ (card‘𝐵) ∈ (card‘𝐴) ↔ ¬ 𝐵 ≺ 𝐴)) |
| 9 | 5, 8 | bitrid 284 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → ((card‘𝐴) ⊆ (card‘𝐵) ↔ ¬ 𝐵 ≺ 𝐴)) |
| 10 | 1, 9 | bitr3d 282 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∈ wcel 2119 ⊆ wss 3883 class class class wbr 5072 dom cdm 5618 Oncon0 6310 ‘cfv 6485 ≼ cdom 8881 ≺ csdm 8882 cardccrd 9850 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rab 3392 df-v 3433 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-ord 6313 df-on 6314 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-er 8633 df-en 8884 df-dom 8885 df-sdom 8886 df-card 9854 |
| This theorem is referenced by: fidomtri 9908 harsdom 9910 infdif 10121 infdif2 10122 infunsdom1 10125 infunsdom 10126 infxp 10127 domtri 10469 canthp1lem2 10567 pwfseqlem4a 10575 pwfseqlem4 10576 gchaleph 10585 numinfctb 43548 |
| Copyright terms: Public domain | W3C validator |