| 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 8923 | . . . . 5 ⊢ Rel ≈ | |
| 2 | 1 | brrelex1i 5694 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ∈ V) |
| 3 | endom 8950 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ≼ 𝐵) | |
| 4 | xpdom1g 9038 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) | |
| 5 | 2, 3, 4 | syl2anr 597 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
| 6 | 1 | brrelex2i 5695 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
| 7 | endom 8950 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ≼ 𝐷) | |
| 8 | xpdom2g 9037 | . . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐶 ≼ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) | |
| 9 | 6, 7, 8 | syl2an 596 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) |
| 10 | domtr 8978 | . . 3 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐶) ∧ (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) | |
| 11 | 5, 9, 10 | syl2anc 584 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) |
| 12 | 1 | brrelex2i 5695 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ∈ V) |
| 13 | ensym 8974 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 14 | endom 8950 | . . . . 5 ⊢ (𝐵 ≈ 𝐴 → 𝐵 ≼ 𝐴) | |
| 15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≼ 𝐴) |
| 16 | xpdom1g 9038 | . . . 4 ⊢ ((𝐷 ∈ V ∧ 𝐵 ≼ 𝐴) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) | |
| 17 | 12, 15, 16 | syl2anr 597 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) |
| 18 | 1 | brrelex1i 5694 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
| 19 | ensym 8974 | . . . . 5 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≈ 𝐶) | |
| 20 | endom 8950 | . . . . 5 ⊢ (𝐷 ≈ 𝐶 → 𝐷 ≼ 𝐶) | |
| 21 | 19, 20 | syl 17 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≼ 𝐶) |
| 22 | xpdom2g 9037 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐷 ≼ 𝐶) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) | |
| 23 | 18, 21, 22 | syl2an 596 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) |
| 24 | domtr 8978 | . . 3 ⊢ (((𝐵 × 𝐷) ≼ (𝐴 × 𝐷) ∧ (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) | |
| 25 | 17, 23, 24 | syl2anc 584 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) |
| 26 | sbth 9061 | . 2 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐷) ∧ (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) | |
| 27 | 11, 25, 26 | syl2anc 584 | 1 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∈ wcel 2109 Vcvv 3447 class class class wbr 5107 × cxp 5636 ≈ cen 8915 ≼ cdom 8916 |
| 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 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-1st 7968 df-2nd 7969 df-er 8671 df-en 8919 df-dom 8920 |
| This theorem is referenced by: map2xp 9111 unxpdom2 9201 sucxpdom 9202 xpnum 9904 infxpenlem 9966 infxpidm2 9970 xpdjuen 10133 mapdjuen 10134 pwdjuen 10135 djuxpdom 10139 ackbij1lem5 10176 canthp1lem1 10605 xpnnen 16179 qnnen 16181 rexpen 16196 met2ndci 24410 re2ndc 24689 dyadmbl 25501 opnmblALT 25504 mbfimaopnlem 25556 mblfinlem1 37651 |
| Copyright terms: Public domain | W3C validator |