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 33445
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 485 . . . . . . 7 ((𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)) → 𝑦 = [𝑥](𝐴 × 𝐴))
2 ecxpid 33444 . . . . . . . 8 (𝑥𝐴 → [𝑥](𝐴 × 𝐴) = 𝐴)
32adantr 481 . . . . . . 7 ((𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)) → [𝑥](𝐴 × 𝐴) = 𝐴)
41, 3eqtrd 2774 . . . . . 6 ((𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)) → 𝑦 = 𝐴)
54rexlimiva 3132 . . . . 5 (∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴) → 𝑦 = 𝐴)
65adantl 482 . . . 4 ((𝐴 ≠ ∅ ∧ ∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴)) → 𝑦 = 𝐴)
7 n0 4281 . . . . . . 7 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
87biimpi 217 . . . . . 6 (𝐴 ≠ ∅ → ∃𝑥 𝑥𝐴)
9 simpl 483 . . . . . . . . . 10 ((𝑦 = 𝐴𝑥𝐴) → 𝑦 = 𝐴)
102adantl 482 . . . . . . . . . 10 ((𝑦 = 𝐴𝑥𝐴) → [𝑥](𝐴 × 𝐴) = 𝐴)
119, 10eqtr4d 2777 . . . . . . . . 9 ((𝑦 = 𝐴𝑥𝐴) → 𝑦 = [𝑥](𝐴 × 𝐴))
1211ex 413 . . . . . . . 8 (𝑦 = 𝐴 → (𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)))
1312ancld 555 . . . . . . 7 (𝑦 = 𝐴 → (𝑥𝐴 → (𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴))))
1413eximdv 1924 . . . . . 6 (𝑦 = 𝐴 → (∃𝑥 𝑥𝐴 → ∃𝑥(𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴))))
158, 14mpan9 511 . . . . 5 ((𝐴 ≠ ∅ ∧ 𝑦 = 𝐴) → ∃𝑥(𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)))
16 df-rex 3064 . . . . 5 (∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴) ↔ ∃𝑥(𝑥𝐴𝑦 = [𝑥](𝐴 × 𝐴)))
1715, 16sylibr 235 . . . 4 ((𝐴 ≠ ∅ ∧ 𝑦 = 𝐴) → ∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴))
186, 17impbida 806 . . 3 (𝐴 ≠ ∅ → (∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴) ↔ 𝑦 = 𝐴))
19 vex 3435 . . . 4 𝑦 ∈ V
2019elqs 8701 . . 3 (𝑦 ∈ (𝐴 / (𝐴 × 𝐴)) ↔ ∃𝑥𝐴 𝑦 = [𝑥](𝐴 × 𝐴))
21 velsn 4571 . . 3 (𝑦 ∈ {𝐴} ↔ 𝑦 = 𝐴)
2218, 20, 213bitr4g 315 . 2 (𝐴 ≠ ∅ → (𝑦 ∈ (𝐴 / (𝐴 × 𝐴)) ↔ 𝑦 ∈ {𝐴}))
2322eqrdv 2737 1 (𝐴 ≠ ∅ → (𝐴 / (𝐴 × 𝐴)) = {𝐴})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wex 1786  wcel 2119  wne 2934  wrex 3063  c0 4261  {csn 4555   × cxp 5616  [cec 8631   / cqs 8632
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ne 2935  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-br 5073  df-opab 5135  df-xp 5624  df-cnv 5626  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-ec 8635  df-qs 8639
This theorem is referenced by:  qustriv  33447
  Copyright terms: Public domain W3C validator