ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  0g0 GIF version

Theorem 0g0 13375
Description: The identity element function evaluates to the empty set on an empty structure. (Contributed by Stefan O'Rear, 2-Oct-2015.)
Assertion
Ref Expression
0g0 ∅ = (0g‘∅)

Proof of Theorem 0g0
Dummy variables 𝑒 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 4190 . . 3 ∅ ∈ V
2 base0 13048 . . . 4 ∅ = (Base‘∅)
3 eqid 2209 . . . 4 (+g‘∅) = (+g‘∅)
4 eqid 2209 . . . 4 (0g‘∅) = (0g‘∅)
52, 3, 4grpidvalg 13372 . . 3 (∅ ∈ V → (0g‘∅) = (℩𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥))))
61, 5ax-mp 5 . 2 (0g‘∅) = (℩𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥)))
7 noel 3475 . . . . . 6 ¬ 𝑒 ∈ ∅
87intnanr 934 . . . . 5 ¬ (𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥))
98nex 1526 . . . 4 ¬ ∃𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥))
10 euex 2087 . . . 4 (∃!𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥)) → ∃𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥)))
119, 10mto 666 . . 3 ¬ ∃!𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥))
12 iotanul 5270 . . 3 (¬ ∃!𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥)) → (℩𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥))) = ∅)
1311, 12ax-mp 5 . 2 (℩𝑒(𝑒 ∈ ∅ ∧ ∀𝑥 ∈ ∅ ((𝑒(+g‘∅)𝑥) = 𝑥 ∧ (𝑥(+g‘∅)𝑒) = 𝑥))) = ∅
146, 13eqtr2i 2231 1 ∅ = (0g‘∅)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wa 104   = wceq 1375  wex 1518  ∃!weu 2057  wcel 2180  wral 2488  Vcvv 2779  c0 3471  cio 5252  cfv 5294  (class class class)co 5974  +gcplusg 13076  0gc0g 13255
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-sep 4181  ax-nul 4189  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-cnex 8058  ax-resscn 8059  ax-1re 8061  ax-addrcl 8064
This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ral 2493  df-rex 2494  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-iota 5254  df-fun 5296  df-fn 5297  df-fv 5302  df-riota 5927  df-ov 5977  df-inn 9079  df-ndx 13001  df-slot 13002  df-base 13004  df-0g 13257
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator