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

Theorem map1 6866
Description: Set exponentiation: ordinal 1 to any set is equinumerous to ordinal 1. Exercise 4.42(b) of [Mendelson] p. 255. (Contributed by NM, 17-Dec-2003.)
Assertion
Ref Expression
map1 (𝐴𝑉 → (1o𝑚 𝐴) ≈ 1o)

Proof of Theorem map1
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fnmap 6709 . . 3 𝑚 Fn (V × V)
2 1oex 6477 . . 3 1o ∈ V
3 elex 2771 . . 3 (𝐴𝑉𝐴 ∈ V)
4 fnovex 5951 . . 3 (( ↑𝑚 Fn (V × V) ∧ 1o ∈ V ∧ 𝐴 ∈ V) → (1o𝑚 𝐴) ∈ V)
51, 2, 3, 4mp3an12i 1352 . 2 (𝐴𝑉 → (1o𝑚 𝐴) ∈ V)
62a1i 9 . 2 (𝐴𝑉 → 1o ∈ V)
7 0ex 4156 . . 3 ∅ ∈ V
872a1i 27 . 2 (𝐴𝑉 → (𝑥 ∈ (1o𝑚 𝐴) → ∅ ∈ V))
9 p0ex 4217 . . . 4 {∅} ∈ V
10 xpexg 4773 . . . 4 ((𝐴𝑉 ∧ {∅} ∈ V) → (𝐴 × {∅}) ∈ V)
119, 10mpan2 425 . . 3 (𝐴𝑉 → (𝐴 × {∅}) ∈ V)
1211a1d 22 . 2 (𝐴𝑉 → (𝑦 ∈ 1o → (𝐴 × {∅}) ∈ V))
13 el1o 6490 . . . . 5 (𝑦 ∈ 1o𝑦 = ∅)
1413a1i 9 . . . 4 (𝐴𝑉 → (𝑦 ∈ 1o𝑦 = ∅))
15 df1o2 6482 . . . . . . . 8 1o = {∅}
1615oveq1i 5928 . . . . . . 7 (1o𝑚 𝐴) = ({∅} ↑𝑚 𝐴)
1716eleq2i 2260 . . . . . 6 (𝑥 ∈ (1o𝑚 𝐴) ↔ 𝑥 ∈ ({∅} ↑𝑚 𝐴))
18 elmapg 6715 . . . . . . 7 (({∅} ∈ V ∧ 𝐴𝑉) → (𝑥 ∈ ({∅} ↑𝑚 𝐴) ↔ 𝑥:𝐴⟶{∅}))
199, 18mpan 424 . . . . . 6 (𝐴𝑉 → (𝑥 ∈ ({∅} ↑𝑚 𝐴) ↔ 𝑥:𝐴⟶{∅}))
2017, 19bitrid 192 . . . . 5 (𝐴𝑉 → (𝑥 ∈ (1o𝑚 𝐴) ↔ 𝑥:𝐴⟶{∅}))
217fconst2 5775 . . . . 5 (𝑥:𝐴⟶{∅} ↔ 𝑥 = (𝐴 × {∅}))
2220, 21bitr2di 197 . . . 4 (𝐴𝑉 → (𝑥 = (𝐴 × {∅}) ↔ 𝑥 ∈ (1o𝑚 𝐴)))
2314, 22anbi12d 473 . . 3 (𝐴𝑉 → ((𝑦 ∈ 1o𝑥 = (𝐴 × {∅})) ↔ (𝑦 = ∅ ∧ 𝑥 ∈ (1o𝑚 𝐴))))
24 ancom 266 . . 3 ((𝑦 = ∅ ∧ 𝑥 ∈ (1o𝑚 𝐴)) ↔ (𝑥 ∈ (1o𝑚 𝐴) ∧ 𝑦 = ∅))
2523, 24bitr2di 197 . 2 (𝐴𝑉 → ((𝑥 ∈ (1o𝑚 𝐴) ∧ 𝑦 = ∅) ↔ (𝑦 ∈ 1o𝑥 = (𝐴 × {∅}))))
265, 6, 8, 12, 25en2d 6822 1 (𝐴𝑉 → (1o𝑚 𝐴) ≈ 1o)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1364  wcel 2164  Vcvv 2760  c0 3446  {csn 3618   class class class wbr 4029   × cxp 4657   Fn wfn 5249  wf 5250  (class class class)co 5918  1oc1o 6462  𝑚 cmap 6702  cen 6792
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-iun 3914  df-br 4030  df-opab 4091  df-mpt 4092  df-tr 4128  df-id 4324  df-iord 4397  df-on 4399  df-suc 4402  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-ov 5921  df-oprab 5922  df-mpo 5923  df-1st 6193  df-2nd 6194  df-1o 6469  df-map 6704  df-en 6795
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator