Users' Mathboxes Mathbox for ML < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  finxp0 Structured version   Visualization version   GIF version

Theorem finxp0 34690
Description: The value of Cartesian exponentiation at zero. (Contributed by ML, 24-Oct-2020.)
Assertion
Ref Expression
finxp0 (𝑈↑↑∅) = ∅

Proof of Theorem finxp0
Dummy variables 𝑛 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0ex 5184 . . . . 5 ∅ ∈ V
2 vex 3474 . . . . 5 𝑦 ∈ V
31, 2opnzi 5339 . . . 4 ⟨∅, 𝑦⟩ ≠ ∅
43nesymi 3064 . . 3 ¬ ∅ = ⟨∅, 𝑦
5 peano1 7576 . . . . 5 ∅ ∈ ω
6 df-finxp 34683 . . . . . 6 (𝑈↑↑∅) = {𝑦 ∣ (∅ ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))), ⟨∅, 𝑦⟩)‘∅))}
76abeq2i 2947 . . . . 5 (𝑦 ∈ (𝑈↑↑∅) ↔ (∅ ∈ ω ∧ ∅ = (rec((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))), ⟨∅, 𝑦⟩)‘∅)))
85, 7mpbiran 708 . . . 4 (𝑦 ∈ (𝑈↑↑∅) ↔ ∅ = (rec((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))), ⟨∅, 𝑦⟩)‘∅))
9 opex 5329 . . . . . 6 ⟨∅, 𝑦⟩ ∈ V
109rdg0 8032 . . . . 5 (rec((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))), ⟨∅, 𝑦⟩)‘∅) = ⟨∅, 𝑦
1110eqeq2i 2834 . . . 4 (∅ = (rec((𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o𝑥𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨ 𝑛, (1st𝑥)⟩, ⟨𝑛, 𝑥⟩))), ⟨∅, 𝑦⟩)‘∅) ↔ ∅ = ⟨∅, 𝑦⟩)
128, 11bitri 278 . . 3 (𝑦 ∈ (𝑈↑↑∅) ↔ ∅ = ⟨∅, 𝑦⟩)
134, 12mtbir 326 . 2 ¬ 𝑦 ∈ (𝑈↑↑∅)
1413nel0 4284 1 (𝑈↑↑∅) = ∅
Colors of variables: wff setvar class
Syntax hints:  wa 399   = wceq 1538  wcel 2115  Vcvv 3471  c0 4266  ifcif 4440  cop 4546   cuni 4811   × cxp 5526  cfv 6328  cmpo 7132  ωcom 7555  1st c1st 7662  reccrdg 8020  1oc1o 8070  ↑↑cfinxp 34682
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-10 2146  ax-11 2162  ax-12 2178  ax-ext 2793  ax-sep 5176  ax-nul 5183  ax-pow 5239  ax-pr 5303  ax-un 7436
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3or 1085  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2071  df-mo 2623  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2892  df-nfc 2960  df-ne 3008  df-ral 3131  df-rex 3132  df-reu 3133  df-rab 3135  df-v 3473  df-sbc 3750  df-csb 3858  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4267  df-if 4441  df-pw 4514  df-sn 4541  df-pr 4543  df-tp 4545  df-op 4547  df-uni 4812  df-iun 4894  df-br 5040  df-opab 5102  df-mpt 5120  df-tr 5146  df-id 5433  df-eprel 5438  df-po 5447  df-so 5448  df-fr 5487  df-we 5489  df-xp 5534  df-rel 5535  df-cnv 5536  df-co 5537  df-dm 5538  df-rn 5539  df-res 5540  df-ima 5541  df-pred 6121  df-ord 6167  df-on 6168  df-lim 6169  df-suc 6170  df-iota 6287  df-fun 6330  df-fn 6331  df-f 6332  df-f1 6333  df-fo 6334  df-f1o 6335  df-fv 6336  df-om 7556  df-wrecs 7922  df-recs 7983  df-rdg 8021  df-finxp 34683
This theorem is referenced by:  finxp00  34701
  Copyright terms: Public domain W3C validator