| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > djuxpdom | Structured version Visualization version GIF version | ||
| Description: Cartesian product dominates disjoint union for sets with cardinality greater than 1. Similar to Proposition 10.36 of [TakeutiZaring] p. 93. (Contributed by Mario Carneiro, 18-May-2015.) |
| Ref | Expression |
|---|---|
| djuxpdom | ⊢ ((1o ≺ 𝐴 ∧ 1o ≺ 𝐵) → (𝐴 ⊔ 𝐵) ≼ (𝐴 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-dju 9860 | . . 3 ⊢ (𝐴 ⊔ 𝐵) = (({∅} × 𝐴) ∪ ({1o} × 𝐵)) | |
| 2 | 0ex 5258 | . . . . . . 7 ⊢ ∅ ∈ V | |
| 3 | relsdom 8935 | . . . . . . . 8 ⊢ Rel ≺ | |
| 4 | 3 | brrelex2i 5705 | . . . . . . 7 ⊢ (1o ≺ 𝐴 → 𝐴 ∈ V) |
| 5 | xpsnen2g 9043 | . . . . . . 7 ⊢ ((∅ ∈ V ∧ 𝐴 ∈ V) → ({∅} × 𝐴) ≈ 𝐴) | |
| 6 | 2, 4, 5 | sylancr 596 | . . . . . 6 ⊢ (1o ≺ 𝐴 → ({∅} × 𝐴) ≈ 𝐴) |
| 7 | sdomen2 9095 | . . . . . 6 ⊢ (({∅} × 𝐴) ≈ 𝐴 → (1o ≺ ({∅} × 𝐴) ↔ 1o ≺ 𝐴)) | |
| 8 | 6, 7 | syl 17 | . . . . 5 ⊢ (1o ≺ 𝐴 → (1o ≺ ({∅} × 𝐴) ↔ 1o ≺ 𝐴)) |
| 9 | 8 | ibir 270 | . . . 4 ⊢ (1o ≺ 𝐴 → 1o ≺ ({∅} × 𝐴)) |
| 10 | 1on 8451 | . . . . . . 7 ⊢ 1o ∈ On | |
| 11 | 3 | brrelex2i 5705 | . . . . . . 7 ⊢ (1o ≺ 𝐵 → 𝐵 ∈ V) |
| 12 | xpsnen2g 9043 | . . . . . . 7 ⊢ ((1o ∈ On ∧ 𝐵 ∈ V) → ({1o} × 𝐵) ≈ 𝐵) | |
| 13 | 10, 11, 12 | sylancr 596 | . . . . . 6 ⊢ (1o ≺ 𝐵 → ({1o} × 𝐵) ≈ 𝐵) |
| 14 | sdomen2 9095 | . . . . . 6 ⊢ (({1o} × 𝐵) ≈ 𝐵 → (1o ≺ ({1o} × 𝐵) ↔ 1o ≺ 𝐵)) | |
| 15 | 13, 14 | syl 17 | . . . . 5 ⊢ (1o ≺ 𝐵 → (1o ≺ ({1o} × 𝐵) ↔ 1o ≺ 𝐵)) |
| 16 | 15 | ibir 270 | . . . 4 ⊢ (1o ≺ 𝐵 → 1o ≺ ({1o} × 𝐵)) |
| 17 | unxpdom 9204 | . . . 4 ⊢ ((1o ≺ ({∅} × 𝐴) ∧ 1o ≺ ({1o} × 𝐵)) → (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ≼ (({∅} × 𝐴) × ({1o} × 𝐵))) | |
| 18 | 9, 16, 17 | syl2an 605 | . . 3 ⊢ ((1o ≺ 𝐴 ∧ 1o ≺ 𝐵) → (({∅} × 𝐴) ∪ ({1o} × 𝐵)) ≼ (({∅} × 𝐴) × ({1o} × 𝐵))) |
| 19 | 1, 18 | eqbrtrid 5136 | . 2 ⊢ ((1o ≺ 𝐴 ∧ 1o ≺ 𝐵) → (𝐴 ⊔ 𝐵) ≼ (({∅} × 𝐴) × ({1o} × 𝐵))) |
| 20 | xpen 9113 | . . 3 ⊢ ((({∅} × 𝐴) ≈ 𝐴 ∧ ({1o} × 𝐵) ≈ 𝐵) → (({∅} × 𝐴) × ({1o} × 𝐵)) ≈ (𝐴 × 𝐵)) | |
| 21 | 6, 13, 20 | syl2an 605 | . 2 ⊢ ((1o ≺ 𝐴 ∧ 1o ≺ 𝐵) → (({∅} × 𝐴) × ({1o} × 𝐵)) ≈ (𝐴 × 𝐵)) |
| 22 | domentr 8995 | . 2 ⊢ (((𝐴 ⊔ 𝐵) ≼ (({∅} × 𝐴) × ({1o} × 𝐵)) ∧ (({∅} × 𝐴) × ({1o} × 𝐵)) ≈ (𝐴 × 𝐵)) → (𝐴 ⊔ 𝐵) ≼ (𝐴 × 𝐵)) | |
| 23 | 19, 21, 22 | syl2anc 593 | 1 ⊢ ((1o ≺ 𝐴 ∧ 1o ≺ 𝐵) → (𝐴 ⊔ 𝐵) ≼ (𝐴 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∈ wcel 2143 Vcvv 3455 ∪ cun 3903 ∅c0 4286 {csn 4583 class class class wbr 5101 × cxp 5646 Oncon0 6347 1oc1o 8431 ≈ cen 8925 ≼ cdom 8926 ≺ csdm 8927 ⊔ cdju 9857 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1100 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-int 4907 df-br 5102 df-opab 5164 df-mpt 5183 df-tr 5209 df-id 5543 df-eprel 5548 df-po 5556 df-so 5557 df-fr 5601 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-ord 6350 df-on 6351 df-suc 6353 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-1st 7971 df-2nd 7972 df-1o 8438 df-2o 8439 df-er 8679 df-en 8929 df-dom 8930 df-sdom 8931 df-dju 9860 |
| This theorem is referenced by: canthp1lem1 10611 |
| Copyright terms: Public domain | W3C validator |