| 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 9045 | . . . . . . 7 ⊢ ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 2 | simp3 1139 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ 𝐴) | |
| 3 | infdif 10132 | . . . . . . . . 9 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → (𝐴 ∖ 𝐵) ≈ 𝐴) | |
| 4 | 3 | ensymd 8956 | . . . . . . . 8 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐴 ≈ (𝐴 ∖ 𝐵)) |
| 5 | sdomentr 9053 | . . . . . . . 8 ⊢ ((𝐵 ≺ 𝐴 ∧ 𝐴 ≈ (𝐴 ∖ 𝐵)) → 𝐵 ≺ (𝐴 ∖ 𝐵)) | |
| 6 | 2, 4, 5 | syl2anc 585 | . . . . . . 7 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → 𝐵 ≺ (𝐴 ∖ 𝐵)) |
| 7 | 1, 6 | nsyl3 138 | . . . . . 6 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴 ∧ 𝐵 ≺ 𝐴) → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵) |
| 8 | 7 | 3expia 1122 | . . . . 5 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐵 ≺ 𝐴 → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 9 | 8 | 3adant2 1132 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐵 ≺ 𝐴 → ¬ (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 10 | 9 | con2d 134 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 → ¬ 𝐵 ≺ 𝐴)) |
| 11 | domtri2 9915 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) | |
| 12 | 11 | 3adant3 1133 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ≼ 𝐵 ↔ ¬ 𝐵 ≺ 𝐴)) |
| 13 | 10, 12 | sylibrd 259 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 → 𝐴 ≼ 𝐵)) |
| 14 | simp1 1137 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → 𝐴 ∈ dom card) | |
| 15 | difss 4090 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 16 | ssdomg 8951 | . . . 4 ⊢ (𝐴 ∈ dom card → ((𝐴 ∖ 𝐵) ⊆ 𝐴 → (𝐴 ∖ 𝐵) ≼ 𝐴)) | |
| 17 | 14, 15, 16 | mpisyl 21 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ∖ 𝐵) ≼ 𝐴) |
| 18 | domtr 8958 | . . . 4 ⊢ (((𝐴 ∖ 𝐵) ≼ 𝐴 ∧ 𝐴 ≼ 𝐵) → (𝐴 ∖ 𝐵) ≼ 𝐵) | |
| 19 | 18 | ex 412 | . . 3 ⊢ ((𝐴 ∖ 𝐵) ≼ 𝐴 → (𝐴 ≼ 𝐵 → (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 20 | 17, 19 | syl 17 | . 2 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 ≼ 𝐵 → (𝐴 ∖ 𝐵) ≼ 𝐵)) |
| 21 | 13, 20 | impbid 212 | 1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card ∧ ω ≼ 𝐴) → ((𝐴 ∖ 𝐵) ≼ 𝐵 ↔ 𝐴 ≼ 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ w3a 1087 ∈ wcel 2114 ∖ cdif 3900 ⊆ wss 3903 class class class wbr 5100 dom cdm 5634 ωcom 7820 ≈ cen 8894 ≼ cdom 8895 ≺ csdm 8896 cardccrd 9861 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-inf2 9564 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-oadd 8413 df-er 8647 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-oi 9429 df-dju 9827 df-card 9865 |
| This theorem is referenced by: axgroth3 10756 |
| Copyright terms: Public domain | W3C validator |