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

Theorem intopsn 17375
 Description: The internal operation for a set is the trivial operation iff the set is a singleton. Formerly part of proof of ring1zr 19398. (Contributed by FL, 13-Feb-2010.) (Revised by AV, 23-Jan-2020.)
Assertion
Ref Expression
intopsn (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → (𝐵 = {𝑍} ↔ = {⟨⟨𝑍, 𝑍⟩, 𝑍⟩}))

Proof of Theorem intopsn
StepHypRef Expression
1 simpl 474 . . . 4 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → :(𝐵 × 𝐵)⟶𝐵)
2 id 22 . . . . . 6 (𝐵 = {𝑍} → 𝐵 = {𝑍})
32sqxpeqd 5250 . . . . 5 (𝐵 = {𝑍} → (𝐵 × 𝐵) = ({𝑍} × {𝑍}))
43, 2feq23d 6153 . . . 4 (𝐵 = {𝑍} → ( :(𝐵 × 𝐵)⟶𝐵 :({𝑍} × {𝑍})⟶{𝑍}))
51, 4syl5ibcom 235 . . 3 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → (𝐵 = {𝑍} → :({𝑍} × {𝑍})⟶{𝑍}))
6 fdm 6164 . . . . . . 7 ( :(𝐵 × 𝐵)⟶𝐵 → dom = (𝐵 × 𝐵))
76eqcomd 2730 . . . . . 6 ( :(𝐵 × 𝐵)⟶𝐵 → (𝐵 × 𝐵) = dom )
87adantr 472 . . . . 5 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → (𝐵 × 𝐵) = dom )
9 fdm 6164 . . . . . 6 ( :({𝑍} × {𝑍})⟶{𝑍} → dom = ({𝑍} × {𝑍}))
109eqeq2d 2734 . . . . 5 ( :({𝑍} × {𝑍})⟶{𝑍} → ((𝐵 × 𝐵) = dom ↔ (𝐵 × 𝐵) = ({𝑍} × {𝑍})))
118, 10syl5ibcom 235 . . . 4 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → ( :({𝑍} × {𝑍})⟶{𝑍} → (𝐵 × 𝐵) = ({𝑍} × {𝑍})))
12 xpid11 5454 . . . 4 ((𝐵 × 𝐵) = ({𝑍} × {𝑍}) ↔ 𝐵 = {𝑍})
1311, 12syl6ib 241 . . 3 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → ( :({𝑍} × {𝑍})⟶{𝑍} → 𝐵 = {𝑍}))
145, 13impbid 202 . 2 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → (𝐵 = {𝑍} ↔ :({𝑍} × {𝑍})⟶{𝑍}))
15 simpr 479 . . . 4 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → 𝑍𝐵)
16 xpsng 6521 . . . 4 ((𝑍𝐵𝑍𝐵) → ({𝑍} × {𝑍}) = {⟨𝑍, 𝑍⟩})
1715, 16sylancom 704 . . 3 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → ({𝑍} × {𝑍}) = {⟨𝑍, 𝑍⟩})
1817feq2d 6144 . 2 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → ( :({𝑍} × {𝑍})⟶{𝑍} ↔ :{⟨𝑍, 𝑍⟩}⟶{𝑍}))
19 opex 5037 . . . 4 𝑍, 𝑍⟩ ∈ V
20 fsng 6519 . . . 4 ((⟨𝑍, 𝑍⟩ ∈ V ∧ 𝑍𝐵) → ( :{⟨𝑍, 𝑍⟩}⟶{𝑍} ↔ = {⟨⟨𝑍, 𝑍⟩, 𝑍⟩}))
2119, 20mpan 708 . . 3 (𝑍𝐵 → ( :{⟨𝑍, 𝑍⟩}⟶{𝑍} ↔ = {⟨⟨𝑍, 𝑍⟩, 𝑍⟩}))
2221adantl 473 . 2 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → ( :{⟨𝑍, 𝑍⟩}⟶{𝑍} ↔ = {⟨⟨𝑍, 𝑍⟩, 𝑍⟩}))
2314, 18, 223bitrd 294 1 (( :(𝐵 × 𝐵)⟶𝐵𝑍𝐵) → (𝐵 = {𝑍} ↔ = {⟨⟨𝑍, 𝑍⟩, 𝑍⟩}))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 383   = wceq 1596   ∈ wcel 2103  Vcvv 3304  {csn 4285  ⟨cop 4291   × cxp 5216  dom cdm 5218  ⟶wf 5997 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1835  ax-4 1850  ax-5 1952  ax-6 2018  ax-7 2054  ax-9 2112  ax-10 2132  ax-11 2147  ax-12 2160  ax-13 2355  ax-ext 2704  ax-sep 4889  ax-nul 4897  ax-pr 5011 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1074  df-tru 1599  df-ex 1818  df-nf 1823  df-sb 2011  df-eu 2575  df-mo 2576  df-clab 2711  df-cleq 2717  df-clel 2720  df-nfc 2855  df-ne 2897  df-ral 3019  df-rex 3020  df-reu 3021  df-rab 3023  df-v 3306  df-dif 3683  df-un 3685  df-in 3687  df-ss 3694  df-nul 4024  df-if 4195  df-sn 4286  df-pr 4288  df-op 4292  df-br 4761  df-opab 4821  df-mpt 4838  df-id 5128  df-xp 5224  df-rel 5225  df-cnv 5226  df-co 5227  df-dm 5228  df-rn 5229  df-fun 6003  df-fn 6004  df-f 6005  df-f1 6006  df-fo 6007  df-f1o 6008 This theorem is referenced by:  mgmb1mgm1  17376
 Copyright terms: Public domain W3C validator