![]() |
Mathbox for ML |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > elxp8 | Structured version Visualization version GIF version |
Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp7 8047. (Contributed by ML, 19-Oct-2020.) |
Ref | Expression |
---|---|
elxp8 | ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xp1st 8044 | . . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → (1st ‘𝐴) ∈ 𝐵) | |
2 | ssv 4019 | . . . . 5 ⊢ 𝐵 ⊆ V | |
3 | ssid 4017 | . . . . 5 ⊢ 𝐶 ⊆ 𝐶 | |
4 | xpss12 5703 | . . . . 5 ⊢ ((𝐵 ⊆ V ∧ 𝐶 ⊆ 𝐶) → (𝐵 × 𝐶) ⊆ (V × 𝐶)) | |
5 | 2, 3, 4 | mp2an 692 | . . . 4 ⊢ (𝐵 × 𝐶) ⊆ (V × 𝐶) |
6 | 5 | sseli 3990 | . . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ (V × 𝐶)) |
7 | 1, 6 | jca 511 | . 2 ⊢ (𝐴 ∈ (𝐵 × 𝐶) → ((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶))) |
8 | xpss 5704 | . . . . 5 ⊢ (V × 𝐶) ⊆ (V × V) | |
9 | 8 | sseli 3990 | . . . 4 ⊢ (𝐴 ∈ (V × 𝐶) → 𝐴 ∈ (V × V)) |
10 | 9 | adantl 481 | . . 3 ⊢ (((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)) → 𝐴 ∈ (V × V)) |
11 | xp2nd 8045 | . . . 4 ⊢ (𝐴 ∈ (V × 𝐶) → (2nd ‘𝐴) ∈ 𝐶) | |
12 | 11 | anim2i 617 | . . 3 ⊢ (((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)) → ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)) |
13 | elxp7 8047 | . . 3 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))) | |
14 | 10, 12, 13 | sylanbrc 583 | . 2 ⊢ (((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)) → 𝐴 ∈ (𝐵 × 𝐶)) |
15 | 7, 14 | impbii 209 | 1 ⊢ (𝐴 ∈ (𝐵 × 𝐶) ↔ ((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 206 ∧ wa 395 ∈ wcel 2105 Vcvv 3477 ⊆ wss 3962 × cxp 5686 ‘cfv 6562 1st c1st 8010 2nd c2nd 8011 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1791 ax-4 1805 ax-5 1907 ax-6 1964 ax-7 2004 ax-8 2107 ax-9 2115 ax-10 2138 ax-11 2154 ax-12 2174 ax-ext 2705 ax-sep 5301 ax-nul 5311 ax-pr 5437 ax-un 7753 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1539 df-fal 1549 df-ex 1776 df-nf 1780 df-sb 2062 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2726 df-clel 2813 df-nfc 2889 df-ne 2938 df-ral 3059 df-rex 3068 df-rab 3433 df-v 3479 df-dif 3965 df-un 3967 df-in 3969 df-ss 3979 df-nul 4339 df-if 4531 df-sn 4631 df-pr 4633 df-op 4637 df-uni 4912 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5582 df-xp 5694 df-rel 5695 df-cnv 5696 df-co 5697 df-dm 5698 df-rn 5699 df-iota 6515 df-fun 6564 df-fv 6570 df-1st 8012 df-2nd 8013 |
This theorem is referenced by: finxpsuclem 37379 |
Copyright terms: Public domain | W3C validator |