| Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > xppss12 | Structured version Visualization version GIF version | ||
| Description: Proper subset theorem for Cartesian product. (Contributed by Steven Nguyen, 17-Jul-2022.) |
| Ref | Expression |
|---|---|
| xppss12 | ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → (𝐴 × 𝐶) ⊊ (𝐵 × 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pssss 4055 | . . 3 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ⊆ 𝐵) | |
| 2 | pssss 4055 | . . 3 ⊢ (𝐶 ⊊ 𝐷 → 𝐶 ⊆ 𝐷) | |
| 3 | xpss12 5681 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐶 ⊆ 𝐷) → (𝐴 × 𝐶) ⊆ (𝐵 × 𝐷)) | |
| 4 | 1, 2, 3 | syl2an 608 | . 2 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → (𝐴 × 𝐶) ⊆ (𝐵 × 𝐷)) |
| 5 | simpl 488 | . . . . 5 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → 𝐴 ⊊ 𝐵) | |
| 6 | pssne 4056 | . . . . . 6 ⊢ (𝐴 ⊊ 𝐵 → 𝐴 ≠ 𝐵) | |
| 7 | 6 | necomd 3016 | . . . . 5 ⊢ (𝐴 ⊊ 𝐵 → 𝐵 ≠ 𝐴) |
| 8 | neneq 2967 | . . . . . 6 ⊢ (𝐵 ≠ 𝐴 → ¬ 𝐵 = 𝐴) | |
| 9 | 8 | intnanrd 495 | . . . . 5 ⊢ (𝐵 ≠ 𝐴 → ¬ (𝐵 = 𝐴 ∧ 𝐷 = 𝐶)) |
| 10 | 5, 7, 9 | 3syl 19 | . . . 4 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → ¬ (𝐵 = 𝐴 ∧ 𝐷 = 𝐶)) |
| 11 | pssn0 43039 | . . . . 5 ⊢ (𝐴 ⊊ 𝐵 → 𝐵 ≠ ∅) | |
| 12 | pssn0 43039 | . . . . 5 ⊢ (𝐶 ⊊ 𝐷 → 𝐷 ≠ ∅) | |
| 13 | xp11 6178 | . . . . 5 ⊢ ((𝐵 ≠ ∅ ∧ 𝐷 ≠ ∅) → ((𝐵 × 𝐷) = (𝐴 × 𝐶) ↔ (𝐵 = 𝐴 ∧ 𝐷 = 𝐶))) | |
| 14 | 11, 12, 13 | syl2an 608 | . . . 4 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → ((𝐵 × 𝐷) = (𝐴 × 𝐶) ↔ (𝐵 = 𝐴 ∧ 𝐷 = 𝐶))) |
| 15 | 10, 14 | mtbird 328 | . . 3 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → ¬ (𝐵 × 𝐷) = (𝐴 × 𝐶)) |
| 16 | neqne 2969 | . . . 4 ⊢ (¬ (𝐵 × 𝐷) = (𝐴 × 𝐶) → (𝐵 × 𝐷) ≠ (𝐴 × 𝐶)) | |
| 17 | 16 | necomd 3016 | . . 3 ⊢ (¬ (𝐵 × 𝐷) = (𝐴 × 𝐶) → (𝐴 × 𝐶) ≠ (𝐵 × 𝐷)) |
| 18 | 15, 17 | syl 18 | . 2 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → (𝐴 × 𝐶) ≠ (𝐵 × 𝐷)) |
| 19 | df-pss 3928 | . 2 ⊢ ((𝐴 × 𝐶) ⊊ (𝐵 × 𝐷) ↔ ((𝐴 × 𝐶) ⊆ (𝐵 × 𝐷) ∧ (𝐴 × 𝐶) ≠ (𝐵 × 𝐷))) | |
| 20 | 4, 18, 19 | sylanbrc 595 | 1 ⊢ ((𝐴 ⊊ 𝐵 ∧ 𝐶 ⊊ 𝐷) → (𝐴 × 𝐶) ⊊ (𝐵 × 𝐷)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ≠ wne 2961 ⊆ wss 3908 ⊊ wpss 3909 ∅c0 4289 × cxp 5664 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-11 2195 ax-ext 2738 ax-sep 5262 ax-pr 5409 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ne 2962 df-ral 3083 df-rex 3093 df-rab 3420 df-v 3460 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5672 df-rel 5673 df-cnv 5674 df-dm 5676 df-rn 5677 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |