Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  prproropf1olem3 Structured version   Visualization version   GIF version

Theorem prproropf1olem3 48921
Description: Lemma 3 for prproropf1o 48923. (Contributed by AV, 13-Mar-2023.)
Hypotheses
Ref Expression
prproropf1o.o 𝑂 = (𝑅 ∩ (𝑉 × 𝑉))
prproropf1o.p 𝑃 = {𝑝 ∈ 𝒫 𝑉 ∣ (♯‘𝑝) = 2}
prproropf1o.f 𝐹 = (𝑝 ∈ 𝑃 ↦ ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩)
Assertion
Ref Expression
prproropf1olem3 ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑂) → (𝐹‘{(1st ‘𝑊), (2nd ‘𝑊)}) = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩)
Distinct variable groups:   𝑉,𝑝   𝑊,𝑝   𝑂,𝑝   𝑃,𝑝   𝑅,𝑝
Allowed substitution hint:   𝐹(𝑝)

Proof of Theorem prproropf1olem3
StepHypRef Expression
1 prproropf1o.f . 2 𝐹 = (𝑝 ∈ 𝑃 ↦ ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩)
2 infeq1 9506 . . . 4 (𝑝 = {(1st ‘𝑊), (2nd ‘𝑊)} → inf(𝑝, 𝑉, 𝑅) = inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅))
3 supeq1 9474 . . . 4 (𝑝 = {(1st ‘𝑊), (2nd ‘𝑊)} → sup(𝑝, 𝑉, 𝑅) = sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅))
42, 3opeq12d 4853 . . 3 (𝑝 = {(1st ‘𝑊), (2nd ‘𝑊)} → ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩ = ⟨inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅), sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅)⟩)
5 prproropf1o.o . . . . 5 𝑂 = (𝑅 ∩ (𝑉 × 𝑉))
65prproropf1olem0 48918 . . . 4 (𝑊 ∈ 𝑂 ↔ (𝑊 = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩ ∧ ((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊)))
7 simpl 488 . . . . . . . 8 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → 𝑅 Or 𝑉)
8 simprll 791 . . . . . . . 8 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → (1st ‘𝑊) ∈ 𝑉)
9 simprlr 792 . . . . . . . 8 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → (2nd ‘𝑊) ∈ 𝑉)
10 infpr 9534 . . . . . . . 8 ((𝑅 Or 𝑉 ∧ (1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) → inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅) = if((1st ‘𝑊)𝑅(2nd ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)))
117, 8, 9, 10syl3anc 1399 . . . . . . 7 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅) = if((1st ‘𝑊)𝑅(2nd ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)))
12 iftrue 4491 . . . . . . . 8 ((1st ‘𝑊)𝑅(2nd ‘𝑊) → if((1st ‘𝑊)𝑅(2nd ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)) = (1st ‘𝑊))
1312ad2antll 742 . . . . . . 7 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → if((1st ‘𝑊)𝑅(2nd ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)) = (1st ‘𝑊))
1411, 13eqtrd 2798 . . . . . 6 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅) = (1st ‘𝑊))
15 suppr 9501 . . . . . . . 8 ((𝑅 Or 𝑉 ∧ (1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) → sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅) = if((2nd ‘𝑊)𝑅(1st ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)))
167, 8, 9, 15syl3anc 1399 . . . . . . 7 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅) = if((2nd ‘𝑊)𝑅(1st ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)))
17 soasym 5599 . . . . . . . . 9 ((𝑅 Or 𝑉 ∧ ((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉)) → ((1st ‘𝑊)𝑅(2nd ‘𝑊) → ¬ (2nd ‘𝑊)𝑅(1st ‘𝑊)))
1817impr 460 . . . . . . . 8 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → ¬ (2nd ‘𝑊)𝑅(1st ‘𝑊))
1918iffalsed 4496 . . . . . . 7 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → if((2nd ‘𝑊)𝑅(1st ‘𝑊), (1st ‘𝑊), (2nd ‘𝑊)) = (2nd ‘𝑊))
2016, 19eqtrd 2798 . . . . . 6 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅) = (2nd ‘𝑊))
2114, 20opeq12d 4853 . . . . 5 ((𝑅 Or 𝑉 ∧ (((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → ⟨inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅), sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅)⟩ = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩)
22213adantr1 1188 . . . 4 ((𝑅 Or 𝑉 ∧ (𝑊 = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩ ∧ ((1st ‘𝑊) ∈ 𝑉 ∧ (2nd ‘𝑊) ∈ 𝑉) ∧ (1st ‘𝑊)𝑅(2nd ‘𝑊))) → ⟨inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅), sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅)⟩ = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩)
236, 22sylan2b 606 . . 3 ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑂) → ⟨inf({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅), sup({(1st ‘𝑊), (2nd ‘𝑊)}, 𝑉, 𝑅)⟩ = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩)
244, 23sylan9eqr 2820 . 2 (((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑂) ∧ 𝑝 = {(1st ‘𝑊), (2nd ‘𝑊)}) → ⟨inf(𝑝, 𝑉, 𝑅), sup(𝑝, 𝑉, 𝑅)⟩ = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩)
25 prproropf1o.p . . 3 𝑃 = {𝑝 ∈ 𝒫 𝑉 ∣ (♯‘𝑝) = 2}
265, 25prproropf1olem1 48919 . 2 ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑂) → {(1st ‘𝑊), (2nd ‘𝑊)} ∈ 𝑃)
27 opex 5439 . . 3 ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩ ∈ V
2827a1i 11 . 2 ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑂) → ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩ ∈ V)
291, 24, 26, 28fvmptd2 7033 1 ((𝑅 Or 𝑉 ∧ 𝑊 ∈ 𝑂) → (𝐹‘{(1st ‘𝑊), (2nd ‘𝑊)}) = ⟨(1st ‘𝑊), (2nd ‘𝑊)⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454   ∩ cin 4092  ifcif 4485  𝒫 cpw 4560  {cpr 4590  ⟨cop 4840   class class class wbr 5108   ↦ cmpt 5192   Or wor 5565   × cxp 5656  ‘cfv 6566  1st c1st 8033  2nd c2nd 8034  supcsup 9469  infcinf 9470  2c2 12437  ♯chash 14515
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-er 8755  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-sup 9471  df-inf 9472  df-dju 10019  df-card 10057  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-n0 12647  df-z 12734  df-uz 13006  df-fz 13680  df-hash 14516
This theorem is used by:  prproropf1o  48923
  Copyright terms: Public domain W3C validator