| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > infdif2 | Structured version Visualization version GIF version | ||
| Description: Cardinality ordering for an infinite class difference. (Contributed by NM, 24-Mar-2007.) (Revised by Mario Carneiro, 29-Apr-2015.) |
| Ref | Expression |
|---|---|
| infdif2 | ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 ↔ 𝐴 ≼ 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | domnsym 9101 | . . . . . . 7 ⊢ ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 2 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ 𝐴) | |
| 3 | infdif 10243 | . . . . . . . . 9 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → (𝐴 ∖ 𝐵) ≈ 𝐴) | |
| 4 | 3 | ensymd 9011 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ (𝐴 ∖ 𝐵)) |
| 5 | sdomentr 9109 | . . . . . . . 8 ⊢ ((𝐵 ≺ 𝐴 ∧ 𝐴 ≈ (𝐴 ∖ 𝐵)) → 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 6 | 2, 4, 5 | syl2anc 596 | . . . . . . 7 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ (𝐴 ∖ 𝐵)) |
| 7 | 1, 6 | nsyl3 139 | . . . . . 6 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵) |
| 8 | 7 | 3expia 1139 | . . . . 5 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐵 ≺ 𝐴 → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 9 | 8 | 3adant2 1149 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐵 ≺ 𝐴 → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 10 | 9 | con2d 135 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴)) |
| 11 | domtri2 10027 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) | |
| 12 | 11 | 3adant3 1150 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) |
| 13 | 10, 12 | sylibrd 262 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 → 𝐴 ≼ 𝐵)) |
| 14 | simp1 1154 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → 𝐴 ∈ dom card) | |
| 15 | difss 4083 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 16 | ssdomg 9006 | . . . 4 ⊢ (𝐴 ∈ dom card → ((𝐴 ∖ 𝐵) ⊆ 𝐴 → (𝐴 ∖ 𝐵) ≼ 𝐴)) | |
| 17 | 14, 15, 16 | mpisyl 22 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ∖ 𝐵) ≼ 𝐴) |
| 18 | domtr 9013 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → (𝐴 ∖ 𝐵) ≼ 𝐵) | |
| 19 | 18 | ex 418 | . . 3 ⊢ ((𝐴 ∖ 𝐵) ≼ 𝐴 → (𝐴 ≼ 𝐵 → (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 20 | 17, 19 | syl 18 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ≼ 𝐵 → (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 21 | 13, 20 | impbid 215 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 ↔ 𝐴 ≼ 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1103 ∈ wcel 2145 ∖ cdif 3896 ⊆ wss 3899 class class class wbr 5103 dom cdm 5648 ωcom 7861 ≈ cen 8949 ≼ cdom 8950 ≺ csdm 8951 cardccrd 9973 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7735 ax-inf2 9620 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 df-se 5602 df-we 5603 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-pred 6294 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6484 df-fun 6530 df-fn 6531 df-f 6532 df-f1 6533 df-fo 6534 df-f1o 6535 df-fv 6536 df-isom 6537 df-riota 7366 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8455 df-2o 8456 df-oadd 8459 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-fin 8956 df-oi 9482 df-dju 9939 df-card 9977 |
| This theorem is used by: axgroth3 10873 |
| Copyright terms: Public domain | W3C validator |