| 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 8944 | . . . . 5 ⊢ Rel ≈ | |
| 2 | 1 | brrelex1i 5717 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ∈ V) |
| 3 | endom 8972 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ≼ 𝐵) | |
| 4 | xpdom1g 9058 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) | |
| 5 | 2, 3, 4 | syl2anr 608 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
| 6 | 1 | brrelex2i 5718 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
| 7 | endom 8972 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ≼ 𝐷) | |
| 8 | xpdom2g 9057 | . . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐶 ≼ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) | |
| 9 | 6, 7, 8 | syl2an 607 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) |
| 10 | domtr 9000 | . . 3 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐶) ∧ (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) | |
| 11 | 5, 9, 10 | syl2anc 595 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) |
| 12 | 1 | brrelex2i 5718 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ∈ V) |
| 13 | ensym 8996 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
| 14 | endom 8972 | . . . . 5 ⊢ (𝐵 ≈ 𝐴 → 𝐵 ≼ 𝐴) | |
| 15 | 13, 14 | syl 18 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≼ 𝐴) |
| 16 | xpdom1g 9058 | . . . 4 ⊢ ((𝐷 ∈ V ∧ 𝐵 ≼ 𝐴) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) | |
| 17 | 12, 15, 16 | syl2anr 608 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) |
| 18 | 1 | brrelex1i 5717 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
| 19 | ensym 8996 | . . . . 5 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≈ 𝐶) | |
| 20 | endom 8972 | . . . . 5 ⊢ (𝐷 ≈ 𝐶 → 𝐷 ≼ 𝐶) | |
| 21 | 19, 20 | syl 18 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≼ 𝐶) |
| 22 | xpdom2g 9057 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐷 ≼ 𝐶) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) | |
| 23 | 18, 21, 22 | syl2an 607 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) |
| 24 | domtr 9000 | . . 3 ⊢ (((𝐵 × 𝐷) ≼ (𝐴 × 𝐷) ∧ (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) | |
| 25 | 17, 23, 24 | syl2anc 595 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) |
| 26 | sbth 9081 | . 2 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐷) ∧ (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) | |
| 27 | 11, 25, 26 | syl2anc 595 | 1 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∈ wcel 2143 Vcvv 3455 class class class wbr 5109 × cxp 5659 ≈ cen 8936 ≼ cdom 8937 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-1st 7982 df-2nd 7983 df-er 8690 df-en 8940 df-dom 8941 |
| This theorem is referenced by: map2xp 9131 unxpdom2 9216 sucxpdom 9217 xpnum 9933 infxpenlem 9993 infxpidm2 9997 xpdjuen 10159 mapdjuen 10160 pwdjuen 10161 djuxpdom 10165 ackbij1lem5 10202 canthp1lem1 10632 xpnnen 16262 qnnen 16264 rexpen 16279 met2ndci 24679 re2ndc 24958 dyadmbl 25759 opnmblALT 25762 mbfimaopnlem 25814 mblfinlem1 38308 |
| Copyright terms: Public domain | W3C validator |