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

Theorem qsxpid 32197
Description: The quotient set of a cartesian product is trivial. (Contributed by Thierry Arnoux, 16-Jan-2024.)
Assertion
Ref Expression
qsxpid (𝐴 ≠ ∅ → (𝐴 / (𝐴 × 𝐴)) = {𝐴})

Proof of Theorem qsxpid
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 486 . . . . . . 7 ((𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)) → 𝑦 = [𝑥](𝐴 × 𝐴))
2 ecxpid 32195 . . . . . . . 8 (𝑥𝐴 → [𝑥](𝐴 × 𝐴) = 𝐴)
32adantr 482 . . . . . . 7 ((𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)) → [𝑥](𝐴 × 𝐴) = 𝐴)
41, 3eqtrd 2773 . . . . . 6 ((𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)) → 𝑦 = 𝐴)
54rexlimiva 3141 . . . . 5 (∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴) → 𝑦 = 𝐴)
65adantl 483 . . . 4 ((𝐴 ≠ ∅ ∧ ∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴)) → 𝑦 = 𝐴)
7 n0 4307 . . . . . . 7 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
87biimpi 215 . . . . . 6 (𝐴 ≠ ∅ → ∃𝑥 𝑥𝐴)
9 simpl 484 . . . . . . . . . 10 ((𝑦 = 𝐴𝑥𝐴) → 𝑦 = 𝐴)
102adantl 483 . . . . . . . . . 10 ((𝑦 = 𝐴𝑥𝐴) → [𝑥](𝐴 × 𝐴) = 𝐴)
119, 10eqtr4d 2776 . . . . . . . . 9 ((𝑦 = 𝐴𝑥𝐴) → 𝑦 = [𝑥](𝐴 × 𝐴))
1211ex 414 . . . . . . . 8 (𝑦 = 𝐴 → (𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)))
1312ancld 552 . . . . . . 7 (𝑦 = 𝐴 → (𝑥𝐴 → (𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴))))
1413eximdv 1921 . . . . . 6 (𝑦 = 𝐴 → (∃𝑥 𝑥𝐴 → ∃𝑥(𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴))))
158, 14mpan9 508 . . . . 5 ((𝐴 ≠ ∅ ∧ 𝑦 = 𝐴) → ∃𝑥(𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)))
16 df-rex 3071 . . . . 5 (∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴) ↔ ∃𝑥(𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)))
1715, 16sylibr 233 . . . 4 ((𝐴 ≠ ∅ ∧ 𝑦 = 𝐴) → ∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴))
186, 17impbida 800 . . 3 (𝐴 ≠ ∅ → (∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴) ↔ 𝑦 = 𝐴))
19 vex 3448 . . . 4 𝑦 ∈ V
2019elqs 8711 . . 3 (𝑦 ∈ (𝐴 / (𝐴 × 𝐴)) ↔ ∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴))
21 velsn 4603 . . 3 (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)
2218, 20, 213bitr4g 314 . 2 (𝐴 ≠ ∅ → (𝑦 ∈ (𝐴 / (𝐴 × 𝐴)) ↔ 𝑦 ∈ {𝐴}))
2322eqrdv 2731 1 (𝐴 ≠ ∅ → (𝐴 / (𝐴 × 𝐴)) = {𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 397   = wceq 1542  wex 1782  wcel 2107  wne 2940  wrex 3070  c0 4283  {csn 4587   × cxp 5632  [cec 8649   / cqs 8650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pr 5385
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-br 5107  df-opab 5169  df-xp 5640  df-cnv 5642  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-ec 8653  df-qs 8657
This theorem is referenced by:  qustriv  32199
  Copyright terms: Public domain W3C validator