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

Theorem fodjum 7487
Description: Lemma for fodjuomni 7490 and fodjumkv 7501. 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 6705 . . . . . . . . 9 1o ≠ ∅
32nesymi 2466 . . . . . . . 8 ¬ ∅ = 1o
43intnan 941 . . . . . . 7 ¬ (¬ ∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧) ∧ ∅ = 1o)
54a1i 9 . . . . . 6 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → ¬ (¬ ∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧) ∧ ∅ = 1o))
6 simprr 537 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → (𝑃‘𝑤) = ∅)
7 fodjuf.p . . . . . . . . 9 𝑃 = (𝑦 ∈ 𝑂 ↦ if(∃𝑧 ∈ 𝐴 (𝐹‘𝑦) = (inl‘𝑧), ∅, 1o))
8 fveqeq2 5704 . . . . . . . . . . 11 (𝑦 = 𝑤 → ((𝐹‘𝑦) = (inl‘𝑧) ↔ (𝐹‘𝑤) = (inl‘𝑧)))
98rexbidv 2551 . . . . . . . . . 10 (𝑦 = 𝑤 → (∃𝑧 ∈ 𝐴 (𝐹‘𝑦) = (inl‘𝑧) ↔ ∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧)))
109ifbid 3662 . . . . . . . . 9 (𝑦 = 𝑤 → if(∃𝑧 ∈ 𝐴 (𝐹‘𝑦) = (inl‘𝑧), ∅, 1o) = if(∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧), ∅, 1o))
11 simprl 535 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → 𝑤 ∈ 𝑂)
12 peano1 4741 . . . . . . . . . . 11 ∅ ∈ ω
1312a1i 9 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → ∅ ∈ ω)
14 1onn 6793 . . . . . . . . . . 11 1o ∈ ω
1514a1i 9 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → 1o ∈ ω)
16 fodjuf.fo . . . . . . . . . . . 12 (𝜑 → 𝐹:𝑂–onto→(𝐴 ⊔ 𝐵))
1716fodjuomnilemdc 7485 . . . . . . . . . . 11 ((𝜑 ∧ 𝑤 ∈ 𝑂) → DECID ∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧))
1817adantrr 483 . . . . . . . . . 10 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → DECID ∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧))
1913, 15, 18ifcldcd 3678 . . . . . . . . 9 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → if(∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧), ∅, 1o) ∈ ω)
207, 10, 11, 19fvmptd3 5799 . . . . . . . 8 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → (𝑃‘𝑤) = if(∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧), ∅, 1o))
216, 20eqtr3d 2273 . . . . . . 7 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → ∅ = if(∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧), ∅, 1o))
22 eqifdc 3677 . . . . . . . 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 1390 . . . . 5 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → (∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧) ∧ ∅ = ∅))
2625simpld 112 . . . 4 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → ∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧))
27 rexm 3627 . . . 4 (∃𝑧 ∈ 𝐴 (𝐹‘𝑤) = (inl‘𝑧) → ∃𝑧 𝑧 ∈ 𝐴)
2826, 27syl 14 . . 3 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → ∃𝑧 𝑧 ∈ 𝐴)
29 eleq1w 2299 . . . 4 (𝑧 = 𝑥 → (𝑧 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴))
3029cbvexv 1974 . . 3 (∃𝑧 𝑧 ∈ 𝐴 ↔ ∃𝑥 𝑥 ∈ 𝐴)
3128, 30sylib 122 . 2 ((𝜑 ∧ (𝑤 ∈ 𝑂 ∧ (𝑃‘𝑤) = ∅)) → ∃𝑥 𝑥 ∈ 𝐴)
321, 31rexlimddv 2673 1 (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
Colors of variables:    wff set class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846   = wceq 1402  ∃wex 1545   ∈ wcel 2209  ∃wrex 2529  ∅c0 3520  ifcif 3638   ↦ cmpt 4192  ωcom 4737  –onto→wfo 5375  ‘cfv 5377  1oc1o 6680   ⊔ cdju 7378  inlcinl 7386
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
This proof depends on definitions:  df-bi 117  df-dc 847  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-1o 6687  df-dju 7379  df-inl 7388  df-inr 7389
This theorem is used by:  fodjuomnilemres  7489  fodjumkvlemres  7500
  Copyright terms: Public domain W3C validator