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

Theorem nninfwlporlem 7340
Description: Lemma for nninfwlpor 7341. The result. (Contributed by Jim Kingdon, 7-Dec-2024.)
Hypotheses
Ref Expression
nninfwlporlem.x (𝜑𝑋:ω⟶2o)
nninfwlporlem.y (𝜑𝑌:ω⟶2o)
nninfwlporlem.d 𝐷 = (𝑖 ∈ ω ↦ if((𝑋𝑖) = (𝑌𝑖), 1o, ∅))
nninfwlporlem.w (𝜑 → ω ∈ WOmni)
Assertion
Ref Expression
nninfwlporlem (𝜑DECID 𝑋 = 𝑌)
Distinct variable groups:   𝐷,𝑖   𝜑,𝑖   𝑖,𝑋   𝑖,𝑌

Proof of Theorem nninfwlporlem
Dummy variables 𝑓 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq1 5626 . . . . . . 7 (𝑓 = 𝐷 → (𝑓𝑥) = (𝐷𝑥))
21eqeq1d 2238 . . . . . 6 (𝑓 = 𝐷 → ((𝑓𝑥) = 1o ↔ (𝐷𝑥) = 1o))
32ralbidv 2530 . . . . 5 (𝑓 = 𝐷 → (∀𝑥 ∈ ω (𝑓𝑥) = 1o ↔ ∀𝑥 ∈ ω (𝐷𝑥) = 1o))
43dcbid 843 . . . 4 (𝑓 = 𝐷 → (DECID𝑥 ∈ ω (𝑓𝑥) = 1oDECID𝑥 ∈ ω (𝐷𝑥) = 1o))
5 nninfwlporlem.w . . . . 5 (𝜑 → ω ∈ WOmni)
6 omex 4685 . . . . . 6 ω ∈ V
7 iswomnimap 7333 . . . . . 6 (ω ∈ V → (ω ∈ WOmni ↔ ∀𝑓 ∈ (2o𝑚 ω)DECID𝑥 ∈ ω (𝑓𝑥) = 1o))
86, 7ax-mp 5 . . . . 5 (ω ∈ WOmni ↔ ∀𝑓 ∈ (2o𝑚 ω)DECID𝑥 ∈ ω (𝑓𝑥) = 1o)
95, 8sylib 122 . . . 4 (𝜑 → ∀𝑓 ∈ (2o𝑚 ω)DECID𝑥 ∈ ω (𝑓𝑥) = 1o)
10 1lt2o 6588 . . . . . . . 8 1o ∈ 2o
1110a1i 9 . . . . . . 7 ((𝜑𝑖 ∈ ω) → 1o ∈ 2o)
12 0lt2o 6587 . . . . . . . 8 ∅ ∈ 2o
1312a1i 9 . . . . . . 7 ((𝜑𝑖 ∈ ω) → ∅ ∈ 2o)
14 2ssom 6670 . . . . . . . . 9 2o ⊆ ω
15 nninfwlporlem.x . . . . . . . . . 10 (𝜑𝑋:ω⟶2o)
1615ffvelcdmda 5770 . . . . . . . . 9 ((𝜑𝑖 ∈ ω) → (𝑋𝑖) ∈ 2o)
1714, 16sselid 3222 . . . . . . . 8 ((𝜑𝑖 ∈ ω) → (𝑋𝑖) ∈ ω)
18 nninfwlporlem.y . . . . . . . . . 10 (𝜑𝑌:ω⟶2o)
1918ffvelcdmda 5770 . . . . . . . . 9 ((𝜑𝑖 ∈ ω) → (𝑌𝑖) ∈ 2o)
2014, 19sselid 3222 . . . . . . . 8 ((𝜑𝑖 ∈ ω) → (𝑌𝑖) ∈ ω)
21 nndceq 6645 . . . . . . . 8 (((𝑋𝑖) ∈ ω ∧ (𝑌𝑖) ∈ ω) → DECID (𝑋𝑖) = (𝑌𝑖))
2217, 20, 21syl2anc 411 . . . . . . 7 ((𝜑𝑖 ∈ ω) → DECID (𝑋𝑖) = (𝑌𝑖))
2311, 13, 22ifcldcd 3640 . . . . . 6 ((𝜑𝑖 ∈ ω) → if((𝑋𝑖) = (𝑌𝑖), 1o, ∅) ∈ 2o)
24 nninfwlporlem.d . . . . . 6 𝐷 = (𝑖 ∈ ω ↦ if((𝑋𝑖) = (𝑌𝑖), 1o, ∅))
2523, 24fmptd 5789 . . . . 5 (𝜑𝐷:ω⟶2o)
26 2onn 6667 . . . . . . 7 2o ∈ ω
2726elexi 2812 . . . . . 6 2o ∈ V
2827, 6elmap 6824 . . . . 5 (𝐷 ∈ (2o𝑚 ω) ↔ 𝐷:ω⟶2o)
2925, 28sylibr 134 . . . 4 (𝜑𝐷 ∈ (2o𝑚 ω))
304, 9, 29rspcdva 2912 . . 3 (𝜑DECID𝑥 ∈ ω (𝐷𝑥) = 1o)
3125ffnd 5474 . . . . 5 (𝜑𝐷 Fn ω)
32 eqidd 2230 . . . . 5 (𝑥 = 𝑖 → 1o = 1o)
33 1onn 6666 . . . . . 6 1o ∈ ω
3433a1i 9 . . . . 5 ((𝜑𝑥 ∈ ω) → 1o ∈ ω)
3533a1i 9 . . . . 5 ((𝜑𝑖 ∈ ω) → 1o ∈ ω)
3631, 32, 34, 35fnmptfvd 5739 . . . 4 (𝜑 → (𝐷 = (𝑖 ∈ ω ↦ 1o) ↔ ∀𝑥 ∈ ω (𝐷𝑥) = 1o))
3736dcbid 843 . . 3 (𝜑 → (DECID 𝐷 = (𝑖 ∈ ω ↦ 1o) ↔ DECID𝑥 ∈ ω (𝐷𝑥) = 1o))
3830, 37mpbird 167 . 2 (𝜑DECID 𝐷 = (𝑖 ∈ ω ↦ 1o))
3915, 18, 24nninfwlporlemd 7339 . . 3 (𝜑 → (𝑋 = 𝑌𝐷 = (𝑖 ∈ ω ↦ 1o)))
4039dcbid 843 . 2 (𝜑 → (DECID 𝑋 = 𝑌DECID 𝐷 = (𝑖 ∈ ω ↦ 1o)))
4138, 40mpbird 167 1 (𝜑DECID 𝑋 = 𝑌)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  DECID wdc 839   = wceq 1395  wcel 2200  wral 2508  Vcvv 2799  c0 3491  ifcif 3602  cmpt 4145  ωcom 4682  wf 5314  cfv 5318  (class class class)co 6001  1oc1o 6555  2oc2o 6556  𝑚 cmap 6795  WOmnicwomni 7330
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680
This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-if 3603  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1o 6562  df-2o 6563  df-map 6797  df-womni 7331
This theorem is referenced by:  nninfwlpor  7341
  Copyright terms: Public domain W3C validator