NFE Home New Foundations Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  NFE Home  >  Th. List  >  dfsset2 GIF version

Theorem dfsset2 4744
Description: Express the S relationship via the set construction functors. (Contributed by SF, 7-Jan-2015.)
Assertion
Ref Expression
dfsset2 S = ⋃11((((V ×k V) ×k V) ∩ k ∼ (( Ins3k SIk SIk SkIns2k ( Ins3k ( Sk k SIk kImagek((Imagek(( Ins3k ∼ (( Ins3k SkIns2k Sk ) “k 111c) (( Ins2k Ins2k Sk ⊕ ( Ins2k Ins3k SkIns3k SIk SIk Sk )) “k 11111c)) “k 111c) ∩ ( Nn ×k V)) ∪ ( Ik ∩ ( ∼ Nn ×k V)))) ∪ Ins2k (( Ins2k SkIns3k SIk ∼ (( Ins2k SkIns3k ((kImagek((Imagek(( Ins3k ∼ (( Ins3k SkIns2k Sk ) “k 111c) (( Ins2k Ins2k Sk ⊕ ( Ins2k Ins3k SkIns3k SIk SIk Sk )) “k 11111c)) “k 111c) ∩ ( Nn ×k V)) ∪ ( Ik ∩ ( ∼ Nn ×k V))) k Sk ) ∪ ({{0c}} ×k V))) “k 111c)) “k 111c))) “k 11111c)) “k Sk )

Proof of Theorem dfsset2
Dummy variables x y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 vex 2863 . . . 4 x V
2 vex 2863 . . . 4 y V
3 opkelssetkg 4269 . . . 4 ((x V y V) → (⟪x, y Skx y))
41, 2, 3mp2an 653 . . 3 (⟪x, y Skx y)
54opabbii 4627 . 2 {x, y x, y Sk } = {x, y x y}
6 setconslem4 4735 . 2 11((((V ×k V) ×k V) ∩ k ∼ (( Ins3k SIk SIk SkIns2k ( Ins3k ( Sk k SIk kImagek((Imagek(( Ins3k ∼ (( Ins3k SkIns2k Sk ) “k 111c) (( Ins2k Ins2k Sk ⊕ ( Ins2k Ins3k SkIns3k SIk SIk Sk )) “k 11111c)) “k 111c) ∩ ( Nn ×k V)) ∪ ( Ik ∩ ( ∼ Nn ×k V)))) ∪ Ins2k (( Ins2k SkIns3k SIk ∼ (( Ins2k SkIns3k ((kImagek((Imagek(( Ins3k ∼ (( Ins3k SkIns2k Sk ) “k 111c) (( Ins2k Ins2k Sk ⊕ ( Ins2k Ins3k SkIns3k SIk SIk Sk )) “k 11111c)) “k 111c) ∩ ( Nn ×k V)) ∪ ( Ik ∩ ( ∼ Nn ×k V))) k Sk ) ∪ ({{0c}} ×k V))) “k 111c)) “k 111c))) “k 11111c)) “k Sk ) = {x, y x, y Sk }
7 df-sset 4726 . 2 S = {x, y x y}
85, 6, 73eqtr4ri 2384 1 S = ⋃11((((V ×k V) ×k V) ∩ k ∼ (( Ins3k SIk SIk SkIns2k ( Ins3k ( Sk k SIk kImagek((Imagek(( Ins3k ∼ (( Ins3k SkIns2k Sk ) “k 111c) (( Ins2k Ins2k Sk ⊕ ( Ins2k Ins3k SkIns3k SIk SIk Sk )) “k 11111c)) “k 111c) ∩ ( Nn ×k V)) ∪ ( Ik ∩ ( ∼ Nn ×k V)))) ∪ Ins2k (( Ins2k SkIns3k SIk ∼ (( Ins2k SkIns3k ((kImagek((Imagek(( Ins3k ∼ (( Ins3k SkIns2k Sk ) “k 111c) (( Ins2k Ins2k Sk ⊕ ( Ins2k Ins3k SkIns3k SIk SIk Sk )) “k 11111c)) “k 111c) ∩ ( Nn ×k V)) ∪ ( Ik ∩ ( ∼ Nn ×k V))) k Sk ) ∪ ({{0c}} ×k V))) “k 111c)) “k 111c))) “k 11111c)) “k Sk )
Colors of variables: wff setvar class
Syntax hints:  wb 176   = wceq 1642   wcel 1710  Vcvv 2860  ccompl 3206   cdif 3207  cun 3208  cin 3209  csymdif 3210   wss 3258  {csn 3738  copk 4058  1cuni1 4134  1cc1c 4135  1cpw1 4136   ×k cxpk 4175  kccnvk 4176   Ins2k cins2k 4177   Ins3k cins3k 4178  k cimak 4180   k ccomk 4181   SIk csik 4182  Imagekcimagek 4183   Sk cssetk 4184   Ik cidk 4185   Nn cnnc 4374  0cc0c 4375  {copab 4623   S csset 4720
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-addc 4379  df-nnc 4380  df-phi 4566  df-op 4567  df-opab 4624  df-sset 4726
This theorem is referenced by:  ssetex  4745
  Copyright terms: Public domain W3C validator