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

Theorem ltexpri 6711
Description: Proposition 9-3.5(iv) of [Gleason] p. 123. (Contributed by NM, 13-May-1996.) (Revised by Mario Carneiro, 14-Jun-2013.)
Assertion
Ref Expression
ltexpri (𝐴<P 𝐵 → ∃𝑥P (𝐴 +P 𝑥) = 𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem ltexpri
Dummy variables 𝑦 𝑧 𝑢 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 103 . . . . . . . 8 ((𝑦 = 𝑢𝑧 = 𝑣) → 𝑧 = 𝑣)
21eleq1d 2106 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → (𝑧 ∈ (2nd𝐴) ↔ 𝑣 ∈ (2nd𝐴)))
3 simpl 102 . . . . . . . . 9 ((𝑦 = 𝑢𝑧 = 𝑣) → 𝑦 = 𝑢)
41, 3oveq12d 5530 . . . . . . . 8 ((𝑦 = 𝑢𝑧 = 𝑣) → (𝑧 +Q 𝑦) = (𝑣 +Q 𝑢))
54eleq1d 2106 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 +Q 𝑦) ∈ (1st𝐵) ↔ (𝑣 +Q 𝑢) ∈ (1st𝐵)))
62, 5anbi12d 442 . . . . . 6 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵)) ↔ (𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))))
76cbvexdva 1804 . . . . 5 (𝑦 = 𝑢 → (∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵)) ↔ ∃𝑣(𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))))
87cbvrabv 2556 . . . 4 {𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))} = {𝑢Q ∣ ∃𝑣(𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))}
91eleq1d 2106 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → (𝑧 ∈ (1st𝐴) ↔ 𝑣 ∈ (1st𝐴)))
104eleq1d 2106 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 +Q 𝑦) ∈ (2nd𝐵) ↔ (𝑣 +Q 𝑢) ∈ (2nd𝐵)))
119, 10anbi12d 442 . . . . . 6 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵)) ↔ (𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))))
1211cbvexdva 1804 . . . . 5 (𝑦 = 𝑢 → (∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵)) ↔ ∃𝑣(𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))))
1312cbvrabv 2556 . . . 4 {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))} = {𝑢Q ∣ ∃𝑣(𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))}
148, 13opeq12i 3554 . . 3 ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ = ⟨{𝑢Q ∣ ∃𝑣(𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))}, {𝑢Q ∣ ∃𝑣(𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))}⟩
1514ltexprlempr 6706 . 2 (𝐴<P 𝐵 → ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ ∈ P)
1614ltexprlemfl 6707 . . . 4 (𝐴<P 𝐵 → (1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) ⊆ (1st𝐵))
1714ltexprlemrl 6708 . . . 4 (𝐴<P 𝐵 → (1st𝐵) ⊆ (1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)))
1816, 17eqssd 2962 . . 3 (𝐴<P 𝐵 → (1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (1st𝐵))
1914ltexprlemfu 6709 . . . 4 (𝐴<P 𝐵 → (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) ⊆ (2nd𝐵))
2014ltexprlemru 6710 . . . 4 (𝐴<P 𝐵 → (2nd𝐵) ⊆ (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)))
2119, 20eqssd 2962 . . 3 (𝐴<P 𝐵 → (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (2nd𝐵))
22 ltrelpr 6603 . . . . . . 7 <P ⊆ (P × P)
2322brel 4392 . . . . . 6 (𝐴<P 𝐵 → (𝐴P𝐵P))
2423simpld 105 . . . . 5 (𝐴<P 𝐵𝐴P)
25 addclpr 6635 . . . . 5 ((𝐴P ∧ ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ ∈ P) → (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) ∈ P)
2624, 15, 25syl2anc 391 . . . 4 (𝐴<P 𝐵 → (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) ∈ P)
2723simprd 107 . . . 4 (𝐴<P 𝐵𝐵P)
28 preqlu 6570 . . . 4 (((𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) ∈ P𝐵P) → ((𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵 ↔ ((1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (1st𝐵) ∧ (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (2nd𝐵))))
2926, 27, 28syl2anc 391 . . 3 (𝐴<P 𝐵 → ((𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵 ↔ ((1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (1st𝐵) ∧ (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (2nd𝐵))))
3018, 21, 29mpbir2and 851 . 2 (𝐴<P 𝐵 → (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵)
31 oveq2 5520 . . . 4 (𝑥 = ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ → (𝐴 +P 𝑥) = (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩))
3231eqeq1d 2048 . . 3 (𝑥 = ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ → ((𝐴 +P 𝑥) = 𝐵 ↔ (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵))
3332rspcev 2656 . 2 ((⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ ∈ P ∧ (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵) → ∃𝑥P (𝐴 +P 𝑥) = 𝐵)
3415, 30, 33syl2anc 391 1 (𝐴<P 𝐵 → ∃𝑥P (𝐴 +P 𝑥) = 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 97  wb 98   = wceq 1243  wex 1381  wcel 1393  wrex 2307  {crab 2310  cop 3378   class class class wbr 3764  cfv 4902  (class class class)co 5512  1st c1st 5765  2nd c2nd 5766  Qcnq 6378   +Q cplq 6380  Pcnp 6389   +P cpp 6391  <P cltp 6393
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311
This theorem depends on definitions:  df-bi 110  df-dc 743  df-3or 886  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-eprel 4026  df-id 4030  df-po 4033  df-iso 4034  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-1o 6001  df-2o 6002  df-oadd 6005  df-omul 6006  df-er 6106  df-ec 6108  df-qs 6112  df-ni 6402  df-pli 6403  df-mi 6404  df-lti 6405  df-plpq 6442  df-mpq 6443  df-enq 6445  df-nqqs 6446  df-plqqs 6447  df-mqqs 6448  df-1nqqs 6449  df-rq 6450  df-ltnqqs 6451  df-enq0 6522  df-nq0 6523  df-0nq0 6524  df-plq0 6525  df-mq0 6526  df-inp 6564  df-iplp 6566  df-iltp 6568
This theorem is referenced by:  lteupri  6715  ltaprlem  6716  ltaprg  6717  ltmprr  6740  recexgt0sr  6858  mulgt0sr  6862
  Copyright terms: Public domain W3C validator