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

Theorem elnp1st2nd 6572
Description: Membership in positive reals, using 1st and 2nd to refer to the lower and upper cut. (Contributed by Jim Kingdon, 3-Oct-2019.)
Assertion
Ref Expression
elnp1st2nd (𝐴P ↔ ((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))))
Distinct variable group:   𝑟,𝑞,𝐴

Proof of Theorem elnp1st2nd
StepHypRef Expression
1 npsspw 6567 . . . . 5 P ⊆ (𝒫 Q × 𝒫 Q)
21sseli 2941 . . . 4 (𝐴P𝐴 ∈ (𝒫 Q × 𝒫 Q))
3 prop 6571 . . . . . . 7 (𝐴P → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
4 elinp 6570 . . . . . . 7 (⟨(1st𝐴), (2nd𝐴)⟩ ∈ P ↔ ((((1st𝐴) ⊆ Q ∧ (2nd𝐴) ⊆ Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))))
53, 4sylib 127 . . . . . 6 (𝐴P → ((((1st𝐴) ⊆ Q ∧ (2nd𝐴) ⊆ Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))))
65simpld 105 . . . . 5 (𝐴P → (((1st𝐴) ⊆ Q ∧ (2nd𝐴) ⊆ Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))))
76simprd 107 . . . 4 (𝐴P → (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴)))
82, 7jca 290 . . 3 (𝐴P → (𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))))
95simprd 107 . . 3 (𝐴P → ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴)))))
108, 9jca 290 . 2 (𝐴P → ((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))))
11 1st2nd2 5801 . . . 4 (𝐴 ∈ (𝒫 Q × 𝒫 Q) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
1211ad2antrr 457 . . 3 (((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))) → 𝐴 = ⟨(1st𝐴), (2nd𝐴)⟩)
13 xp1st 5792 . . . . . . . 8 (𝐴 ∈ (𝒫 Q × 𝒫 Q) → (1st𝐴) ∈ 𝒫 Q)
1413elpwid 3369 . . . . . . 7 (𝐴 ∈ (𝒫 Q × 𝒫 Q) → (1st𝐴) ⊆ Q)
15 xp2nd 5793 . . . . . . . 8 (𝐴 ∈ (𝒫 Q × 𝒫 Q) → (2nd𝐴) ∈ 𝒫 Q)
1615elpwid 3369 . . . . . . 7 (𝐴 ∈ (𝒫 Q × 𝒫 Q) → (2nd𝐴) ⊆ Q)
1714, 16jca 290 . . . . . 6 (𝐴 ∈ (𝒫 Q × 𝒫 Q) → ((1st𝐴) ⊆ Q ∧ (2nd𝐴) ⊆ Q))
1817anim1i 323 . . . . 5 ((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) → (((1st𝐴) ⊆ Q ∧ (2nd𝐴) ⊆ Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))))
1918anim1i 323 . . . 4 (((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))) → ((((1st𝐴) ⊆ Q ∧ (2nd𝐴) ⊆ Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))))
2019, 4sylibr 137 . . 3 (((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))) → ⟨(1st𝐴), (2nd𝐴)⟩ ∈ P)
2112, 20eqeltrd 2114 . 2 (((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))) → 𝐴P)
2210, 21impbii 117 1 (𝐴P ↔ ((𝐴 ∈ (𝒫 Q × 𝒫 Q) ∧ (∃𝑞Q 𝑞 ∈ (1st𝐴) ∧ ∃𝑟Q 𝑟 ∈ (2nd𝐴))) ∧ ((∀𝑞Q (𝑞 ∈ (1st𝐴) ↔ ∃𝑟Q (𝑞 <Q 𝑟𝑟 ∈ (1st𝐴))) ∧ ∀𝑟Q (𝑟 ∈ (2nd𝐴) ↔ ∃𝑞Q (𝑞 <Q 𝑟𝑞 ∈ (2nd𝐴)))) ∧ ∀𝑞Q ¬ (𝑞 ∈ (1st𝐴) ∧ 𝑞 ∈ (2nd𝐴)) ∧ ∀𝑞Q𝑟Q (𝑞 <Q 𝑟 → (𝑞 ∈ (1st𝐴) ∨ 𝑟 ∈ (2nd𝐴))))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 3  wi 4  wa 97  wb 98  wo 629  w3a 885   = wceq 1243  wcel 1393  wral 2306  wrex 2307  wss 2917  𝒫 cpw 3359  cop 3378   class class class wbr 3764   × cxp 4343  cfv 4902  1st c1st 5765  2nd c2nd 5766  Qcnq 6376   <Q cltq 6381  Pcnp 6387
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-pow 3927  ax-pr 3944  ax-un 4170  ax-iinf 4311
This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  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-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-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-id 4030  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-1st 5767  df-2nd 5768  df-qs 6112  df-ni 6400  df-nqqs 6444  df-inp 6562
This theorem is referenced by:  addclpr  6633  mulclpr  6668  ltexprlempr  6704  recexprlempr  6728  cauappcvgprlemcl  6749  caucvgprlemcl  6772  caucvgprprlemcl  6800
  Copyright terms: Public domain W3C validator