| 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 9091 | . . . . . . 7 ⊢ ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 2 | simp3 1154 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ 𝐴) | |
| 3 | infdif 10191 | . . . . . . . . 9 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → (𝐴 ∖ 𝐵) ≈ 𝐴) | |
| 4 | 3 | ensymd 9002 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ (𝐴 ∖ 𝐵)) |
| 5 | sdomentr 9099 | . . . . . . . 8 ⊢ ((𝐵 ≺ 𝐴 ∧ 𝐴 ≈ (𝐴 ∖ 𝐵)) → 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 6 | 2, 4, 5 | syl2anc 595 | . . . . . . 7 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ (𝐴 ∖ 𝐵)) |
| 7 | 1, 6 | nsyl3 139 | . . . . . 6 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵) |
| 8 | 7 | 3expia 1137 | . . . . 5 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐵 ≺ 𝐴 → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 9 | 8 | 3adant2 1147 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐵 ≺ 𝐴 → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 10 | 9 | con2d 135 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴)) |
| 11 | domtri2 9975 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) | |
| 12 | 11 | 3adant3 1148 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) |
| 13 | 10, 12 | sylibrd 262 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 → 𝐴 ≼ 𝐵)) |
| 14 | simp1 1152 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → 𝐴 ∈ dom card) | |
| 15 | difss 4096 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 16 | ssdomg 8997 | . . . 4 ⊢ (𝐴 ∈ dom card → ((𝐴 ∖ 𝐵) ⊆ 𝐴 → (𝐴 ∖ 𝐵) ≼ 𝐴)) | |
| 17 | 14, 15, 16 | mpisyl 22 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ∖ 𝐵) ≼ 𝐴) |
| 18 | domtr 9004 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → (𝐴 ∖ 𝐵) ≼ 𝐵) | |
| 19 | 18 | ex 417 | . . 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 |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ w3a 1101 ∈ wcel 2149 ∖ cdif 3908 ⊆ wss 3911 class class class wbr 5111 dom cdm 5662 ωcom 7862 ≈ cen 8940 ≼ cdom 8941 ≺ csdm 8942 cardccrd 9921 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-inf2 9610 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-oadd 8457 df-er 8694 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-oi 9472 df-dju 9887 df-card 9925 |
| This theorem is referenced by: axgroth3 10816 |
| Copyright terms: Public domain | W3C validator |