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

Theorem suplocexprlemml 8084
Description: Lemma for suplocexpr 8093. The lower cut of the putative supremum is inhabited. (Contributed by Jim Kingdon, 7-Jan-2024.)
Hypotheses
Ref Expression
suplocexpr.m (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
suplocexpr.ub (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
suplocexpr.loc (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
Assertion
Ref Expression
suplocexprlemml (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴))
Distinct variable groups:   𝐴,𝑠,𝑥,𝑦   𝜑,𝑠,𝑥,𝑦
Allowed substitution hints:   𝜑(𝑧)   𝐴(𝑧)

Proof of Theorem suplocexprlemml
StepHypRef Expression
1 suplocexpr.m . . 3 (𝜑 → ∃𝑥 𝑥 ∈ 𝐴)
2 suplocexpr.ub . . . . . . 7 (𝜑 → ∃𝑥 ∈ P ∀𝑦 ∈ 𝐴 𝑦<P 𝑥)
3 suplocexpr.loc . . . . . . 7 (𝜑 → ∀𝑥 ∈ P ∀𝑦 ∈ P (𝑥<P 𝑦 → (∃𝑧 ∈ 𝐴 𝑥<P 𝑧 ∨ ∀𝑧 ∈ 𝐴 𝑧<P 𝑦)))
41, 2, 3suplocexprlemss 8083 . . . . . 6 (𝜑 → 𝐴 ⊆ P)
54sselda 3248 . . . . 5 ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ P)
6 prop 7843 . . . . 5 (𝑥 ∈ P → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ P)
7 prml 7845 . . . . 5 (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ ∈ P → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
85, 6, 73syl 17 . . . 4 ((𝜑 ∧ 𝑥 ∈ 𝐴) → ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
98ralrimiva 2623 . . 3 (𝜑 → ∀𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
10 r19.2m 3614 . . 3 ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥)) → ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
111, 9, 10syl2anc 415 . 2 (𝜑 → ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
12 suplocexprlemell 8081 . . . 4 (𝑠 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 𝑠 ∈ (1st ‘𝑥))
1312rexbii 2557 . . 3 (∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑠 ∈ Q ∃𝑥 ∈ 𝐴 𝑠 ∈ (1st ‘𝑥))
14 rexcom 2715 . . 3 (∃𝑠 ∈ Q ∃𝑥 ∈ 𝐴 𝑠 ∈ (1st ‘𝑥) ↔ ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
1513, 14bitri 184 . 2 (∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ∃𝑠 ∈ Q 𝑠 ∈ (1st ‘𝑥))
1611, 15sylibr 134 1 (𝜑 → ∃𝑠 ∈ Q 𝑠 ∈ ∪ (1st “ 𝐴))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∨ wo 720  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  ∃wrex 2529  ⟨cop 3712  ∪ cuni 3935   class class class wbr 4130   “ cima 4777  ‘cfv 5377  1st c1st 6372  2nd c2nd 6373  Qcnq 7648  Pcnp 7659  <P cltp 7663
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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-iinf 4735
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  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-ima 4787  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-qs 6813  df-ni 7672  df-nqqs 7716  df-inp 7834  df-iltp 7838
This theorem is used by:  suplocexprlemex  8090
  Copyright terms: Public domain W3C validator