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 8738 | . . . . 5 ⊢ Rel ≈ | |
2 | 1 | brrelex1i 5643 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ∈ V) |
3 | endom 8767 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ≼ 𝐵) | |
4 | xpdom1g 8856 | . . . 4 ⊢ ((𝐶 ∈ V ∧ 𝐴 ≼ 𝐵) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) | |
5 | 2, 3, 4 | syl2anr 597 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐶)) |
6 | 1 | brrelex2i 5644 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ∈ V) |
7 | endom 8767 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐶 ≼ 𝐷) | |
8 | xpdom2g 8855 | . . . 4 ⊢ ((𝐵 ∈ V ∧ 𝐶 ≼ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) | |
9 | 6, 7, 8 | syl2an 596 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) |
10 | domtr 8793 | . . 3 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐶) ∧ (𝐵 × 𝐶) ≼ (𝐵 × 𝐷)) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) | |
11 | 5, 9, 10 | syl2anc 584 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≼ (𝐵 × 𝐷)) |
12 | 1 | brrelex2i 5644 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ∈ V) |
13 | ensym 8789 | . . . . 5 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≈ 𝐴) | |
14 | endom 8767 | . . . . 5 ⊢ (𝐵 ≈ 𝐴 → 𝐵 ≼ 𝐴) | |
15 | 13, 14 | syl 17 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐵 ≼ 𝐴) |
16 | xpdom1g 8856 | . . . 4 ⊢ ((𝐷 ∈ V ∧ 𝐵 ≼ 𝐴) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) | |
17 | 12, 15, 16 | syl2anr 597 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐷)) |
18 | 1 | brrelex1i 5643 | . . . 4 ⊢ (𝐴 ≈ 𝐵 → 𝐴 ∈ V) |
19 | ensym 8789 | . . . . 5 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≈ 𝐶) | |
20 | endom 8767 | . . . . 5 ⊢ (𝐷 ≈ 𝐶 → 𝐷 ≼ 𝐶) | |
21 | 19, 20 | syl 17 | . . . 4 ⊢ (𝐶 ≈ 𝐷 → 𝐷 ≼ 𝐶) |
22 | xpdom2g 8855 | . . . 4 ⊢ ((𝐴 ∈ V ∧ 𝐷 ≼ 𝐶) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) | |
23 | 18, 21, 22 | syl2an 596 | . . 3 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) |
24 | domtr 8793 | . . 3 ⊢ (((𝐵 × 𝐷) ≼ (𝐴 × 𝐷) ∧ (𝐴 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) | |
25 | 17, 23, 24 | syl2anc 584 | . 2 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) |
26 | sbth 8880 | . 2 ⊢ (((𝐴 × 𝐶) ≼ (𝐵 × 𝐷) ∧ (𝐵 × 𝐷) ≼ (𝐴 × 𝐶)) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) | |
27 | 11, 25, 26 | syl2anc 584 | 1 ⊢ ((𝐴 ≈ 𝐵 ∧ 𝐶 ≈ 𝐷) → (𝐴 × 𝐶) ≈ (𝐵 × 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∈ wcel 2106 Vcvv 3432 class class class wbr 5074 × cxp 5587 ≈ cen 8730 ≼ cdom 8731 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-1st 7831 df-2nd 7832 df-er 8498 df-en 8734 df-dom 8735 |
This theorem is referenced by: map2xp 8934 unxpdom2 9031 sucxpdom 9032 xpnum 9709 infxpenlem 9769 infxpidm2 9773 xpdjuen 9935 mapdjuen 9936 pwdjuen 9937 djuxpdom 9941 ackbij1lem5 9980 canthp1lem1 10408 xpnnen 15920 qnnen 15922 rexpen 15937 met2ndci 23678 re2ndc 23964 dyadmbl 24764 opnmblALT 24767 mbfimaopnlem 24819 mblfinlem1 35814 |
Copyright terms: Public domain | W3C validator |