Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elxp8 Structured version   Visualization version   GIF version

Theorem elxp8 38562
Description: Membership in a Cartesian product. This version requires no quantifiers or dummy variables. See also elxp7 8070. (Contributed by ML, 19-Oct-2020.)
Assertion
Ref Expression
elxp8 (𝐴 ∈ (𝐵 × 𝐶) ↔ ((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)))

Proof of Theorem elxp8
StepHypRef Expression
1 xp1st 8067 . . 3 (𝐴 ∈ (𝐵 × 𝐶) → (1st ‘𝐴) ∈ 𝐵)
2 ssv 3937 . . . . 5 𝐵 ⊆ V
3 ssid 3935 . . . . 5 𝐶 ⊆ 𝐶
4 xpss12 5673 . . . . 5 ((𝐵 ⊆ V ∧ 𝐶 ⊆ 𝐶) → (𝐵 × 𝐶) ⊆ (V × 𝐶))
52, 3, 4mp2an 705 . . . 4 (𝐵 × 𝐶) ⊆ (V × 𝐶)
65sseli 3909 . . 3 (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ (V × 𝐶))
71, 6jca 521 . 2 (𝐴 ∈ (𝐵 × 𝐶) → ((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)))
8 xpss 5674 . . . . 5 (V × 𝐶) ⊆ (V × V)
98sseli 3909 . . . 4 (𝐴 ∈ (V × 𝐶) → 𝐴 ∈ (V × V))
109adantl 487 . . 3 (((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)) → 𝐴 ∈ (V × V))
11 xp2nd 8068 . . . 4 (𝐴 ∈ (V × 𝐶) → (2nd ‘𝐴) ∈ 𝐶)
1211anim2i 629 . . 3 (((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)) → ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶))
13 elxp7 8070 . . 3 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st ‘𝐴) ∈ 𝐵 ∧ (2nd ‘𝐴) ∈ 𝐶)))
1410, 12, 13sylanbrc 595 . 2 (((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)) → 𝐴 ∈ (𝐵 × 𝐶))
157, 14impbii 212 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ ((1st ‘𝐴) ∈ 𝐵 ∧ 𝐴 ∈ (V × 𝐶)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   × cxp 5656  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398  ax-un 7783
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fv 6574  df-1st 8035  df-2nd 8036
This theorem is used by:  finxpsuclem  38588
  Copyright terms: Public domain W3C validator