ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  elxp7 GIF version

Theorem elxp7 6377
Description: Membership in a cross product. This version requires no quantifiers or dummy variables. See also elxp4 5255. (Contributed by NM, 19-Aug-2006.)
Assertion
Ref Expression
elxp7 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))

Proof of Theorem elxp7
StepHypRef Expression
1 elex 2827 . 2 (𝐴 ∈ (𝐵 × 𝐶) → 𝐴 ∈ V)
2 elex 2827 . . 3 (𝐴 ∈ (V × V) → 𝐴 ∈ V)
32adantr 276 . 2 ((𝐴 ∈ (V × V) ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) → 𝐴 ∈ V)
4 elxp6 6376 . . 3 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
5 elxp6 6376 . . . . 5 (𝐴 ∈ (V × V) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V)))
6 1stexg 6374 . . . . . . 7 (𝐴 ∈ V → (1st𝐴) ∈ V)
7 2ndexg 6375 . . . . . . 7 (𝐴 ∈ V → (2nd𝐴) ∈ V)
86, 7jca 306 . . . . . 6 (𝐴 ∈ V → ((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V))
98biantrud 304 . . . . 5 (𝐴 ∈ V → (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ V ∧ (2nd𝐴) ∈ V))))
105, 9bitr4id 199 . . . 4 (𝐴 ∈ V → (𝐴 ∈ (V × V) ↔ 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩))
1110anbi1d 465 . . 3 (𝐴 ∈ V → ((𝐴 ∈ (V × V) ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)) ↔ (𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩ ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶))))
124, 11bitr4id 199 . 2 (𝐴 ∈ V → (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶))))
131, 3, 12pm5.21nii 712 1 (𝐴 ∈ (𝐵 × 𝐶) ↔ (𝐴 ∈ (V × V) ∧ ((1st𝐴) ∈ 𝐵 ∧ (2nd𝐴) ∈ 𝐶)))
Colors of variables: wff set class
Syntax hints:  wa 104  wb 105   = wceq 1398  wcel 2205  Vcvv 2815  cop 3697   × cxp 4752  cfv 5357  1st c1st 6345  2nd c2nd 6346
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-fo 5363  df-fv 5365  df-1st 6347  df-2nd 6348
This theorem is referenced by:  xp2  6380  unielxp  6381  1stconst  6430  2ndconst  6431  f1od2  6444
  Copyright terms: Public domain W3C validator