MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  preqsnd Structured version   Visualization version   GIF version

Theorem preqsnd 4577
Description: Equivalence for a pair equal to a singleton, deduction form. (Contributed by Thierry Arnoux, 27-Dec-2016.) (Revised by AV, 13-Jun-2022.)
Hypotheses
Ref Expression
preqsnd.1 (𝜑𝐴 ∈ V)
preqsnd.2 (𝜑𝐵 ∈ V)
Assertion
Ref Expression
preqsnd (𝜑 → ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶𝐵 = 𝐶)))

Proof of Theorem preqsnd
StepHypRef Expression
1 preqsnd.1 . . . 4 (𝜑𝐴 ∈ V)
21adantl 474 . . 3 ((𝐶 ∈ V ∧ 𝜑) → 𝐴 ∈ V)
3 preqsnd.2 . . . 4 (𝜑𝐵 ∈ V)
43adantl 474 . . 3 ((𝐶 ∈ V ∧ 𝜑) → 𝐵 ∈ V)
5 simpl 475 . . 3 ((𝐶 ∈ V ∧ 𝜑) → 𝐶 ∈ V)
6 dfsn2 4381 . . . . 5 {𝐶} = {𝐶, 𝐶}
76eqeq2i 2811 . . . 4 ({𝐴, 𝐵} = {𝐶} ↔ {𝐴, 𝐵} = {𝐶, 𝐶})
8 preq12bg 4571 . . . . 5 (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐶 ∈ V ∧ 𝐶 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐶} ↔ ((𝐴 = 𝐶𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐶))))
9 oridm 929 . . . . 5 (((𝐴 = 𝐶𝐵 = 𝐶) ∨ (𝐴 = 𝐶𝐵 = 𝐶)) ↔ (𝐴 = 𝐶𝐵 = 𝐶))
108, 9syl6bb 279 . . . 4 (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐶 ∈ V ∧ 𝐶 ∈ V)) → ({𝐴, 𝐵} = {𝐶, 𝐶} ↔ (𝐴 = 𝐶𝐵 = 𝐶)))
117, 10syl5bb 275 . . 3 (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ (𝐶 ∈ V ∧ 𝐶 ∈ V)) → ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶𝐵 = 𝐶)))
122, 4, 5, 5, 11syl22anc 868 . 2 ((𝐶 ∈ V ∧ 𝜑) → ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶𝐵 = 𝐶)))
13 snprc 4442 . . . . . . 7 𝐶 ∈ V ↔ {𝐶} = ∅)
1413biimpi 208 . . . . . 6 𝐶 ∈ V → {𝐶} = ∅)
1514adantr 473 . . . . 5 ((¬ 𝐶 ∈ V ∧ 𝜑) → {𝐶} = ∅)
1615eqeq2d 2809 . . . 4 ((¬ 𝐶 ∈ V ∧ 𝜑) → ({𝐴, 𝐵} = {𝐶} ↔ {𝐴, 𝐵} = ∅))
17 prnzg 4499 . . . . . . 7 (𝐴 ∈ V → {𝐴, 𝐵} ≠ ∅)
18 eqneqall 2982 . . . . . . 7 ({𝐴, 𝐵} = ∅ → ({𝐴, 𝐵} ≠ ∅ → (𝐴 = 𝐶𝐵 = 𝐶)))
1917, 18syl5com 31 . . . . . 6 (𝐴 ∈ V → ({𝐴, 𝐵} = ∅ → (𝐴 = 𝐶𝐵 = 𝐶)))
201, 19syl 17 . . . . 5 (𝜑 → ({𝐴, 𝐵} = ∅ → (𝐴 = 𝐶𝐵 = 𝐶)))
2120adantl 474 . . . 4 ((¬ 𝐶 ∈ V ∧ 𝜑) → ({𝐴, 𝐵} = ∅ → (𝐴 = 𝐶𝐵 = 𝐶)))
2216, 21sylbid 232 . . 3 ((¬ 𝐶 ∈ V ∧ 𝜑) → ({𝐴, 𝐵} = {𝐶} → (𝐴 = 𝐶𝐵 = 𝐶)))
23 eleq1 2866 . . . . . . . . . 10 (𝐶 = 𝐴 → (𝐶 ∈ V ↔ 𝐴 ∈ V))
2423eqcoms 2807 . . . . . . . . 9 (𝐴 = 𝐶 → (𝐶 ∈ V ↔ 𝐴 ∈ V))
2524notbid 310 . . . . . . . 8 (𝐴 = 𝐶 → (¬ 𝐶 ∈ V ↔ ¬ 𝐴 ∈ V))
26 pm2.21 121 . . . . . . . 8 𝐴 ∈ V → (𝐴 ∈ V → (𝐵 = 𝐶 → {𝐴, 𝐵} = {𝐶})))
2725, 26syl6bi 245 . . . . . . 7 (𝐴 = 𝐶 → (¬ 𝐶 ∈ V → (𝐴 ∈ V → (𝐵 = 𝐶 → {𝐴, 𝐵} = {𝐶}))))
2827com13 88 . . . . . 6 (𝐴 ∈ V → (¬ 𝐶 ∈ V → (𝐴 = 𝐶 → (𝐵 = 𝐶 → {𝐴, 𝐵} = {𝐶}))))
291, 28syl 17 . . . . 5 (𝜑 → (¬ 𝐶 ∈ V → (𝐴 = 𝐶 → (𝐵 = 𝐶 → {𝐴, 𝐵} = {𝐶}))))
3029impcom 397 . . . 4 ((¬ 𝐶 ∈ V ∧ 𝜑) → (𝐴 = 𝐶 → (𝐵 = 𝐶 → {𝐴, 𝐵} = {𝐶})))
3130impd 399 . . 3 ((¬ 𝐶 ∈ V ∧ 𝜑) → ((𝐴 = 𝐶𝐵 = 𝐶) → {𝐴, 𝐵} = {𝐶}))
3222, 31impbid 204 . 2 ((¬ 𝐶 ∈ V ∧ 𝜑) → ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶𝐵 = 𝐶)))
3312, 32pm2.61ian 847 1 (𝜑 → ({𝐴, 𝐵} = {𝐶} ↔ (𝐴 = 𝐶𝐵 = 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 198  wa 385  wo 874   = wceq 1653  wcel 2157  wne 2971  Vcvv 3385  c0 4115  {csn 4368  {cpr 4370
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2377  ax-ext 2777
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-3an 1110  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-ne 2972  df-v 3387  df-dif 3772  df-un 3774  df-nul 4116  df-sn 4369  df-pr 4371
This theorem is referenced by:  prnesn  4579  preqsn  4581  opeqsng  5157  1loopgrnb0  26752  disjdifprg  29905
  Copyright terms: Public domain W3C validator