| 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 9122 | . . . . . . 7 ⊢ ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 2 | simp3 1156 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ 𝐴) | |
| 3 | infdif 10286 | . . . . . . . . 9 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → (𝐴 ∖ 𝐵) ≈ 𝐴) | |
| 4 | 3 | ensymd 9032 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ (𝐴 ∖ 𝐵)) |
| 5 | sdomentr 9130 | . . . . . . . 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 10070 | . . . 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 4072 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 16 | ssdomg 9027 | . . . 4 ⊢ (𝐴 ∈ dom card → ((𝐴 ∖ 𝐵) ⊆ 𝐴 → (𝐴 ∖ 𝐵) ≼ 𝐴)) | |
| 17 | 14, 15, 16 | mpisyl 22 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ∖ 𝐵) ≼ 𝐴) |
| 18 | domtr 9034 | . . . 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 2144 ⊆ wss 3895 ∖ cdif 4045 class class class wbr 5102 dom cdm 5650 ωcom 7877 ≈ cen 8970 ≼ cdom 8971 ≺ csdm 8972 cardccrd 10016 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-inf2 9642 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-oadd 8480 df-er 8717 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-oi 9504 df-dju 9982 df-card 10020 |
| This theorem is used by: axgroth3 10916 |
| Copyright terms: Public domain | W3C validator |