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

Theorem 0xp 4447
 Description: The cross product with the empty set is empty. Part of Theorem 3.13(ii) of [Monk1] p. 37. (Contributed by NM, 4-Jul-1994.)
Assertion
Ref Expression
0xp (∅ × 𝐴) = ∅

Proof of Theorem 0xp
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxp 4389 . . 3 (𝑧 ∈ (∅ × 𝐴) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ ∅ ∧ 𝑦𝐴)))
2 noel 3255 . . . . . . 7 ¬ 𝑥 ∈ ∅
3 simprl 491 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ ∅ ∧ 𝑦𝐴)) → 𝑥 ∈ ∅)
42, 3mto 598 . . . . . 6 ¬ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ ∅ ∧ 𝑦𝐴))
54nex 1405 . . . . 5 ¬ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ ∅ ∧ 𝑦𝐴))
65nex 1405 . . . 4 ¬ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ ∅ ∧ 𝑦𝐴))
7 noel 3255 . . . 4 ¬ 𝑧 ∈ ∅
86, 72false 627 . . 3 (∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ ∅ ∧ 𝑦𝐴)) ↔ 𝑧 ∈ ∅)
91, 8bitri 177 . 2 (𝑧 ∈ (∅ × 𝐴) ↔ 𝑧 ∈ ∅)
109eqriv 2053 1 (∅ × 𝐴) = ∅
 Colors of variables: wff set class Syntax hints:   ∧ wa 101   = wceq 1259  ∃wex 1397   ∈ wcel 1409  ∅c0 3251  ⟨cop 3405   × cxp 4370 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 103  ax-ia2 104  ax-ia3 105  ax-in1 554  ax-in2 555  ax-io 640  ax-5 1352  ax-7 1353  ax-gen 1354  ax-ie1 1398  ax-ie2 1399  ax-8 1411  ax-10 1412  ax-11 1413  ax-i12 1414  ax-bndl 1415  ax-4 1416  ax-14 1421  ax-17 1435  ax-i9 1439  ax-ial 1443  ax-i5r 1444  ax-ext 2038  ax-sep 3902  ax-pow 3954  ax-pr 3971 This theorem depends on definitions:  df-bi 114  df-3an 898  df-tru 1262  df-fal 1265  df-nf 1366  df-sb 1662  df-clab 2043  df-cleq 2049  df-clel 2052  df-nfc 2183  df-v 2576  df-dif 2947  df-un 2949  df-in 2951  df-ss 2958  df-nul 3252  df-pw 3388  df-sn 3408  df-pr 3409  df-op 3411  df-opab 3846  df-xp 4378 This theorem is referenced by:  res0  4643  xp0  4770  xpeq0r  4773  xpdisj1  4774  xpima1  4794
 Copyright terms: Public domain W3C validator