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

Theorem fodjum 7313
Description: Lemma for fodjuomni 7316 and fodjumkv 7327. A condition which shows that 𝐴 is inhabited. (Contributed by Jim Kingdon, 27-Jul-2022.) (Revised by Jim Kingdon, 25-Mar-2023.)
Hypotheses
Ref Expression
fodjuf.fo (𝜑𝐹:𝑂onto→(𝐴𝐵))
fodjuf.p 𝑃 = (𝑦𝑂 ↦ if(∃𝑧𝐴 (𝐹𝑦) = (inl‘𝑧), ∅, 1o))
fodjum.z (𝜑 → ∃𝑤𝑂 (𝑃𝑤) = ∅)
Assertion
Ref Expression
fodjum (𝜑 → ∃𝑥 𝑥𝐴)
Distinct variable groups:   𝜑,𝑦,𝑧   𝑦,𝑂,𝑧   𝑧,𝐴   𝑧,𝐵   𝑧,𝐹   𝑤,𝐴,𝑥,𝑧   𝑦,𝐴,𝑤   𝑦,𝐹   𝜑,𝑤
Allowed substitution hints:   𝜑(𝑥)   𝐵(𝑥,𝑦,𝑤)   𝑃(𝑥,𝑦,𝑧,𝑤)   𝐹(𝑥,𝑤)   𝑂(𝑥,𝑤)

Proof of Theorem fodjum
StepHypRef Expression
1 fodjum.z . 2 (𝜑 → ∃𝑤𝑂 (𝑃𝑤) = ∅)
2 1n0 6578 . . . . . . . . 9 1o ≠ ∅
32nesymi 2446 . . . . . . . 8 ¬ ∅ = 1o
43intnan 934 . . . . . . 7 ¬ (¬ ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = 1o)
54a1i 9 . . . . . 6 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ¬ (¬ ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = 1o))
6 simprr 531 . . . . . . . 8 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → (𝑃𝑤) = ∅)
7 fodjuf.p . . . . . . . . 9 𝑃 = (𝑦𝑂 ↦ if(∃𝑧𝐴 (𝐹𝑦) = (inl‘𝑧), ∅, 1o))
8 fveqeq2 5636 . . . . . . . . . . 11 (𝑦 = 𝑤 → ((𝐹𝑦) = (inl‘𝑧) ↔ (𝐹𝑤) = (inl‘𝑧)))
98rexbidv 2531 . . . . . . . . . 10 (𝑦 = 𝑤 → (∃𝑧𝐴 (𝐹𝑦) = (inl‘𝑧) ↔ ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧)))
109ifbid 3624 . . . . . . . . 9 (𝑦 = 𝑤 → if(∃𝑧𝐴 (𝐹𝑦) = (inl‘𝑧), ∅, 1o) = if(∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧), ∅, 1o))
11 simprl 529 . . . . . . . . 9 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → 𝑤𝑂)
12 peano1 4686 . . . . . . . . . . 11 ∅ ∈ ω
1312a1i 9 . . . . . . . . . 10 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ∅ ∈ ω)
14 1onn 6666 . . . . . . . . . . 11 1o ∈ ω
1514a1i 9 . . . . . . . . . 10 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → 1o ∈ ω)
16 fodjuf.fo . . . . . . . . . . . 12 (𝜑𝐹:𝑂onto→(𝐴𝐵))
1716fodjuomnilemdc 7311 . . . . . . . . . . 11 ((𝜑𝑤𝑂) → DECID𝑧𝐴 (𝐹𝑤) = (inl‘𝑧))
1817adantrr 479 . . . . . . . . . 10 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → DECID𝑧𝐴 (𝐹𝑤) = (inl‘𝑧))
1913, 15, 18ifcldcd 3640 . . . . . . . . 9 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → if(∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧), ∅, 1o) ∈ ω)
207, 10, 11, 19fvmptd3 5728 . . . . . . . 8 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → (𝑃𝑤) = if(∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧), ∅, 1o))
216, 20eqtr3d 2264 . . . . . . 7 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ∅ = if(∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧), ∅, 1o))
22 eqifdc 3639 . . . . . . . 8 (DECID𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) → (∅ = if(∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧), ∅, 1o) ↔ ((∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = ∅) ∨ (¬ ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = 1o))))
2318, 22syl 14 . . . . . . 7 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → (∅ = if(∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧), ∅, 1o) ↔ ((∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = ∅) ∨ (¬ ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = 1o))))
2421, 23mpbid 147 . . . . . 6 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ((∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = ∅) ∨ (¬ ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = 1o)))
255, 24ecased 1383 . . . . 5 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → (∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) ∧ ∅ = ∅))
2625simpld 112 . . . 4 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧))
27 rexm 3591 . . . 4 (∃𝑧𝐴 (𝐹𝑤) = (inl‘𝑧) → ∃𝑧 𝑧𝐴)
2826, 27syl 14 . . 3 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ∃𝑧 𝑧𝐴)
29 eleq1w 2290 . . . 4 (𝑧 = 𝑥 → (𝑧𝐴𝑥𝐴))
3029cbvexv 1965 . . 3 (∃𝑧 𝑧𝐴 ↔ ∃𝑥 𝑥𝐴)
3128, 30sylib 122 . 2 ((𝜑 ∧ (𝑤𝑂 ∧ (𝑃𝑤) = ∅)) → ∃𝑥 𝑥𝐴)
321, 31rexlimddv 2653 1 (𝜑 → ∃𝑥 𝑥𝐴)
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 104  wb 105  wo 713  DECID wdc 839   = wceq 1395  wex 1538  wcel 2200  wrex 2509  c0 3491  ifcif 3602  cmpt 4145  ωcom 4682  ontowfo 5316  cfv 5318  1oc1o 6555  cdju 7204  inlcinl 7212
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
This theorem depends on definitions:  df-bi 117  df-dc 840  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-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-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-1st 6286  df-2nd 6287  df-1o 6562  df-dju 7205  df-inl 7214  df-inr 7215
This theorem is referenced by:  fodjuomnilemres  7315  fodjumkvlemres  7326
  Copyright terms: Public domain W3C validator