| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpen | Structured version Visualization version GIF version | ||
| Description: Equinumerosity law for Cartesian product. Proposition 4.22(b) of [Mendelson] p. 254. (Contributed by NM, 24-Jul-2004.) (Proof shortened by Mario Carneiro, 26-Apr-2015.) |
| Ref | Expression |
|---|---|
| xpen | ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relen 8926 | . . . . 5 ⊢ Rel ≈ | |
| 2 | 1 | brrelex1i 5697 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ∈ V) |
| 3 | endom 8953 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ≼ 𝐵) | |
| 4 | xpdom1g 9043 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) | |
| 5 | 2, 3, 4 | syl2anr 597 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
| 6 | 1 | brrelex2i 5698 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
| 7 | endom 8953 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ≼ 𝐷) | |
| 8 | xpdom2g 9042 | . . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐶 ≼ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) | |
| 9 | 6, 7, 8 | syl2an 596 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) |
| 10 | domtr 8981 | . . 3 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐶) ∧ (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) | |
| 11 | 5, 9, 10 | syl2anc 584 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) |
| 12 | 1 | brrelex2i 5698 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ∈ V) |
| 13 | ensym 8977 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 14 | endom 8953 | . . . . 5 ⊢ (𝐵 ≈ 𝐴 → 𝐵 ≼ 𝐴) | |
| 15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≼ 𝐴) |
| 16 | xpdom1g 9043 | . . . 4 ⊢ ((𝐷 ∈ V ∧ 𝐵 ≼ 𝐴) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) | |
| 17 | 12, 15, 16 | syl2anr 597 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) |
| 18 | 1 | brrelex1i 5697 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
| 19 | ensym 8977 | . . . . 5 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≈ 𝐶) | |
| 20 | endom 8953 | . . . . 5 ⊢ (𝐷 ≈ 𝐶 → 𝐷 ≼ 𝐶) | |
| 21 | 19, 20 | syl 17 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≼ 𝐶) |
| 22 | xpdom2g 9042 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐷 ≼ 𝐶) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) | |
| 23 | 18, 21, 22 | syl2an 596 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) |
| 24 | domtr 8981 | . . 3 ⊢ (((𝐵 × 𝐷) ≼ (𝐴 × 𝐷) ∧ (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) | |
| 25 | 17, 23, 24 | syl2anc 584 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) |
| 26 | sbth 9067 | . 2 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐷) ∧ (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) | |
| 27 | 11, 25, 26 | syl2anc 584 | 1 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2109 Vcvv 3450 class class class wbr 5110 × cxp 5639 ≈ cen 8918 ≼ cdom 8919 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-1st 7971 df-2nd 7972 df-er 8674 df-en 8922 df-dom 8923 |
| This theorem is referenced by: map2xp 9117 unxpdom2 9208 sucxpdom 9209 xpnum 9911 infxpenlem 9973 infxpidm2 9977 xpdjuen 10140 mapdjuen 10141 pwdjuen 10142 djuxpdom 10146 ackbij1lem5 10183 canthp1lem1 10612 xpnnen 16186 qnnen 16188 rexpen 16203 met2ndci 24417 re2ndc 24696 dyadmbl 25508 opnmblALT 25511 mbfimaopnlem 25563 mblfinlem1 37658 |
| Copyright terms: Public domain | W3C validator |