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

Theorem ltexpri 7073
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 108 . . . . . . . 8 ((𝑦 = 𝑢𝑧 = 𝑣) → 𝑧 = 𝑣)
21eleq1d 2151 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → (𝑧 ∈ (2nd𝐴) ↔ 𝑣 ∈ (2nd𝐴)))
3 simpl 107 . . . . . . . . 9 ((𝑦 = 𝑢𝑧 = 𝑣) → 𝑦 = 𝑢)
41, 3oveq12d 5607 . . . . . . . 8 ((𝑦 = 𝑢𝑧 = 𝑣) → (𝑧 +Q 𝑦) = (𝑣 +Q 𝑢))
54eleq1d 2151 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 +Q 𝑦) ∈ (1st𝐵) ↔ (𝑣 +Q 𝑢) ∈ (1st𝐵)))
62, 5anbi12d 457 . . . . . 6 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵)) ↔ (𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))))
76cbvexdva 1847 . . . . 5 (𝑦 = 𝑢 → (∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵)) ↔ ∃𝑣(𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))))
87cbvrabv 2611 . . . 4 {𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))} = {𝑢Q ∣ ∃𝑣(𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))}
91eleq1d 2151 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → (𝑧 ∈ (1st𝐴) ↔ 𝑣 ∈ (1st𝐴)))
104eleq1d 2151 . . . . . . 7 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 +Q 𝑦) ∈ (2nd𝐵) ↔ (𝑣 +Q 𝑢) ∈ (2nd𝐵)))
119, 10anbi12d 457 . . . . . 6 ((𝑦 = 𝑢𝑧 = 𝑣) → ((𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵)) ↔ (𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))))
1211cbvexdva 1847 . . . . 5 (𝑦 = 𝑢 → (∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵)) ↔ ∃𝑣(𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))))
1312cbvrabv 2611 . . . 4 {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))} = {𝑢Q ∣ ∃𝑣(𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))}
148, 13opeq12i 3601 . . 3 ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ = ⟨{𝑢Q ∣ ∃𝑣(𝑣 ∈ (2nd𝐴) ∧ (𝑣 +Q 𝑢) ∈ (1st𝐵))}, {𝑢Q ∣ ∃𝑣(𝑣 ∈ (1st𝐴) ∧ (𝑣 +Q 𝑢) ∈ (2nd𝐵))}⟩
1514ltexprlempr 7068 . 2 (𝐴<P 𝐵 → ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ ∈ P)
1614ltexprlemfl 7069 . . . 4 (𝐴<P 𝐵 → (1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) ⊆ (1st𝐵))
1714ltexprlemrl 7070 . . . 4 (𝐴<P 𝐵 → (1st𝐵) ⊆ (1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)))
1816, 17eqssd 3027 . . 3 (𝐴<P 𝐵 → (1st ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (1st𝐵))
1914ltexprlemfu 7071 . . . 4 (𝐴<P 𝐵 → (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) ⊆ (2nd𝐵))
2014ltexprlemru 7072 . . . 4 (𝐴<P 𝐵 → (2nd𝐵) ⊆ (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)))
2119, 20eqssd 3027 . . 3 (𝐴<P 𝐵 → (2nd ‘(𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩)) = (2nd𝐵))
22 ltrelpr 6965 . . . . . . 7 <P ⊆ (P × P)
2322brel 4446 . . . . . 6 (𝐴<P 𝐵 → (𝐴P𝐵P))
2423simpld 110 . . . . 5 (𝐴<P 𝐵𝐴P)
25 addclpr 6997 . . . . 5 ((𝐴P ∧ ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ ∈ P) → (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) ∈ P)
2624, 15, 25syl2anc 403 . . . 4 (𝐴<P 𝐵 → (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) ∈ P)
2723simprd 112 . . . 4 (𝐴<P 𝐵𝐵P)
28 preqlu 6932 . . . 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 403 . . 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 886 . 2 (𝐴<P 𝐵 → (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵)
31 oveq2 5597 . . . 4 (𝑥 = ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ → (𝐴 +P 𝑥) = (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩))
3231eqeq1d 2091 . . 3 (𝑥 = ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ → ((𝐴 +P 𝑥) = 𝐵 ↔ (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵))
3332rspcev 2712 . 2 ((⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩ ∈ P ∧ (𝐴 +P ⟨{𝑦Q ∣ ∃𝑧(𝑧 ∈ (2nd𝐴) ∧ (𝑧 +Q 𝑦) ∈ (1st𝐵))}, {𝑦Q ∣ ∃𝑧(𝑧 ∈ (1st𝐴) ∧ (𝑧 +Q 𝑦) ∈ (2nd𝐵))}⟩) = 𝐵) → ∃𝑥P (𝐴 +P 𝑥) = 𝐵)
3415, 30, 33syl2anc 403 1 (𝐴<P 𝐵 → ∃𝑥P (𝐴 +P 𝑥) = 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 102  wb 103   = wceq 1285  wex 1422  wcel 1434  wrex 2354  {crab 2357  cop 3425   class class class wbr 3811  cfv 4967  (class class class)co 5589  1st c1st 5842  2nd c2nd 5843  Qcnq 6740   +Q cplq 6742  Pcnp 6751   +P cpp 6753  <P cltp 6755
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-13 1445  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-coll 3919  ax-sep 3922  ax-nul 3930  ax-pow 3974  ax-pr 3999  ax-un 4223  ax-setind 4315  ax-iinf 4365
This theorem depends on definitions:  df-bi 115  df-dc 777  df-3or 921  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ne 2250  df-ral 2358  df-rex 2359  df-reu 2360  df-rab 2362  df-v 2614  df-sbc 2827  df-csb 2920  df-dif 2986  df-un 2988  df-in 2990  df-ss 2997  df-nul 3270  df-pw 3408  df-sn 3428  df-pr 3429  df-op 3431  df-uni 3628  df-int 3663  df-iun 3706  df-br 3812  df-opab 3866  df-mpt 3867  df-tr 3902  df-eprel 4079  df-id 4083  df-po 4086  df-iso 4087  df-iord 4156  df-on 4158  df-suc 4161  df-iom 4368  df-xp 4405  df-rel 4406  df-cnv 4407  df-co 4408  df-dm 4409  df-rn 4410  df-res 4411  df-ima 4412  df-iota 4932  df-fun 4969  df-fn 4970  df-f 4971  df-f1 4972  df-fo 4973  df-f1o 4974  df-fv 4975  df-ov 5592  df-oprab 5593  df-mpt2 5594  df-1st 5844  df-2nd 5845  df-recs 6000  df-irdg 6065  df-1o 6111  df-2o 6112  df-oadd 6115  df-omul 6116  df-er 6220  df-ec 6222  df-qs 6226  df-ni 6764  df-pli 6765  df-mi 6766  df-lti 6767  df-plpq 6804  df-mpq 6805  df-enq 6807  df-nqqs 6808  df-plqqs 6809  df-mqqs 6810  df-1nqqs 6811  df-rq 6812  df-ltnqqs 6813  df-enq0 6884  df-nq0 6885  df-0nq0 6886  df-plq0 6887  df-mq0 6888  df-inp 6926  df-iplp 6928  df-iltp 6930
This theorem is referenced by:  lteupri  7077  ltaprlem  7078  ltaprg  7079  ltmprr  7102  recexgt0sr  7220  mulgt0sr  7224
  Copyright terms: Public domain W3C validator