| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > nndomo | GIF version | ||
| Description: Cardinal ordering agrees with natural number ordering. Example 3 of [Enderton] p. 146. (Contributed by NM, 17-Jun-1998.) |
| Ref | Expression |
|---|---|
| nndomo | ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | php5dom 7154 | . . . . . . . 8 ⊢ (𝐵 ∈ ω → ¬ suc 𝐵 ≼ 𝐵) | |
| 2 | 1 | ad2antlr 493 | . . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ suc 𝐵 ≼ 𝐵) |
| 3 | domtr 7062 | . . . . . . . . 9 ⊢ ((suc 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → suc 𝐵 ≼ 𝐵) | |
| 4 | 3 | expcom 116 | . . . . . . . 8 ⊢ (𝐴 ≼ 𝐵 → (suc 𝐵 ≼ 𝐴 → suc 𝐵 ≼ 𝐵)) |
| 5 | 4 | adantl 277 | . . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (suc 𝐵 ≼ 𝐴 → suc 𝐵 ≼ 𝐵)) |
| 6 | 2, 5 | mtod 673 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ suc 𝐵 ≼ 𝐴) |
| 7 | ssdomg 7055 | . . . . . . 7 ⊢ (𝐴 ∈ ω → (suc 𝐵 ⊆ 𝐴 → suc 𝐵 ≼ 𝐴)) | |
| 8 | 7 | ad2antrr 492 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (suc 𝐵 ⊆ 𝐴 → suc 𝐵 ≼ 𝐴)) |
| 9 | 6, 8 | mtod 673 | . . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ suc 𝐵 ⊆ 𝐴) |
| 10 | nnord 4754 | . . . . . . 7 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 11 | ordsucss 4646 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) | |
| 12 | 10, 11 | syl 14 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) |
| 13 | 12 | ad2antrr 492 | . . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) |
| 14 | 9, 13 | mtod 673 | . . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ∈ 𝐴) |
| 15 | nntri1 6759 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) | |
| 16 | 15 | adantr 276 | . . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
| 17 | 14, 16 | mpbird 167 | . . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → 𝐴 ⊆ 𝐵) |
| 18 | 17 | ex 115 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
| 19 | ssdomg 7055 | . . 3 ⊢ (𝐵 ∈ ω → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) | |
| 20 | 19 | adantl 277 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 → 𝐴 ≼ 𝐵)) |
| 21 | 18, 20 | impbid 129 | 1 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ≼ 𝐵 ↔ 𝐴 ⊆ 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 ⊆ wss 3220 class class class wbr 4125 Ord word 4502 suc csuc 4505 ωcom 4732 ≼ cdom 7011 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-nul 4254 ax-pow 4306 ax-pr 4341 ax-un 4573 ax-setind 4679 ax-iinf 4730 |
| This theorem depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-tr 4225 df-id 4433 df-iord 4506 df-on 4508 df-suc 4511 df-iom 4733 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-res 4781 df-ima 4782 df-iota 5332 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-fv 5380 df-er 6797 df-en 7013 df-dom 7014 |
| This theorem is referenced by: 1ndom2 7156 fisbth 7177 fientri3 7212 hashennnuni 11196 fihashdom 11221 pwf1oexmid 16943 |
| Copyright terms: Public domain | W3C validator |