| 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 6985 | . . . . . . . 8 ⊢ (𝐵 ∈ ω → ¬ suc 𝐵 ≼ 𝐵) | |
| 2 | 1 | ad2antlr 489 | . . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ suc 𝐵 ≼ 𝐵) |
| 3 | domtr 6900 | . . . . . . . . 9 ⊢ ((suc 𝐵 ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → suc 𝐵 ≼ 𝐵) | |
| 4 | 3 | expcom 116 | . . . . . . . 8 ⊢ (𝐴 ≼ 𝐵 → (suc 𝐵 ≼ 𝐴 → suc 𝐵 ≼ 𝐵)) |
| 5 | 4 | adantl 277 | . . . . . . 7 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (suc 𝐵 ≼ 𝐴 → suc 𝐵 ≼ 𝐵)) |
| 6 | 2, 5 | mtod 665 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ suc 𝐵 ≼ 𝐴) |
| 7 | ssdomg 6893 | . . . . . . 7 ⊢ (𝐴 ∈ ω → (suc 𝐵 ⊆ 𝐴 → suc 𝐵 ≼ 𝐴)) | |
| 8 | 7 | ad2antrr 488 | . . . . . 6 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (suc 𝐵 ⊆ 𝐴 → suc 𝐵 ≼ 𝐴)) |
| 9 | 6, 8 | mtod 665 | . . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ suc 𝐵 ⊆ 𝐴) |
| 10 | nnord 4678 | . . . . . . 7 ⊢ (𝐴 ∈ ω → Ord 𝐴) | |
| 11 | ordsucss 4570 | . . . . . . 7 ⊢ (Ord 𝐴 → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) | |
| 12 | 10, 11 | syl 14 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) |
| 13 | 12 | ad2antrr 488 | . . . . 5 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (𝐵 ∈ 𝐴 → suc 𝐵 ⊆ 𝐴)) |
| 14 | 9, 13 | mtod 665 | . . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → ¬ 𝐵 ∈ 𝐴) |
| 15 | nntri1 6605 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) | |
| 16 | 15 | adantr 276 | . . . 4 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → (𝐴 ⊆ 𝐵 ↔ ¬ 𝐵 ∈ 𝐴)) |
| 17 | 14, 16 | mpbird 167 | . . 3 ⊢ (((𝐴 ∈ ω ∧ 𝐵 ∈ ω) ∧ 𝐴 ≼ 𝐵) → 𝐴 ⊆ 𝐵) |
| 18 | 17 | ex 115 | . 2 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 ≼ 𝐵 → 𝐴 ⊆ 𝐵)) |
| 19 | ssdomg 6893 | . . 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 2178 ⊆ wss 3174 class class class wbr 4059 Ord word 4427 suc csuc 4430 ωcom 4656 ≼ cdom 6849 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2180 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-nul 4186 ax-pow 4234 ax-pr 4269 ax-un 4498 ax-setind 4603 ax-iinf 4654 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ne 2379 df-ral 2491 df-rex 2492 df-rab 2495 df-v 2778 df-sbc 3006 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-int 3900 df-br 4060 df-opab 4122 df-tr 4159 df-id 4358 df-iord 4431 df-on 4433 df-suc 4436 df-iom 4657 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-rn 4704 df-res 4705 df-ima 4706 df-iota 5251 df-fun 5292 df-fn 5293 df-f 5294 df-f1 5295 df-fo 5296 df-f1o 5297 df-fv 5298 df-er 6643 df-en 6851 df-dom 6852 |
| This theorem is referenced by: 1ndom2 6987 fisbth 7006 fientri3 7038 hashennnuni 10961 fihashdom 10985 pwf1oexmid 16138 |
| Copyright terms: Public domain | W3C validator |