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

Theorem exmidfodomrlemreseldju 7552
Description: Lemma for exmidfodomrlemrALT 7555. A variant of eldju 7408. (Contributed by Jim Kingdon, 9-Jul-2022.)
Hypotheses
Ref Expression
exmidfodomrlemreseldju.a  |-  ( ph  ->  A  C_  1o )
exmidfodomrlemreseldju.el  |-  ( ph  ->  B  e.  ( A 1o ) )
Assertion
Ref Expression
exmidfodomrlemreseldju  |-  ( ph  ->  ( ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) )  \/  B  =  ( (inr  |`  1o ) `
 (/) ) ) )

Proof of Theorem exmidfodomrlemreseldju
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 exmidfodomrlemreseldju.a . . . . . . . . . . 11  |-  ( ph  ->  A  C_  1o )
21sselda 3248 . . . . . . . . . 10  |-  ( (
ph  /\  x  e.  A )  ->  x  e.  1o )
3 el1o 6710 . . . . . . . . . 10  |-  ( x  e.  1o  <->  x  =  (/) )
42, 3sylib 122 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  A )  ->  x  =  (/) )
54fveq2d 5699 . . . . . . . 8  |-  ( (
ph  /\  x  e.  A )  ->  (
(inl  |`  A ) `  x )  =  ( (inl  |`  A ) `  (/) ) )
65eqeq2d 2250 . . . . . . 7  |-  ( (
ph  /\  x  e.  A )  ->  ( B  =  ( (inl  |`  A ) `  x
)  <->  B  =  (
(inl  |`  A ) `  (/) ) ) )
7 simpr 110 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  A )  ->  x  e.  A )
84, 7eqeltrrd 2316 . . . . . . . 8  |-  ( (
ph  /\  x  e.  A )  ->  (/)  e.  A
)
98biantrurd 305 . . . . . . 7  |-  ( (
ph  /\  x  e.  A )  ->  ( B  =  ( (inl  |`  A ) `  (/) )  <->  ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) ) ) )
106, 9bitrd 188 . . . . . 6  |-  ( (
ph  /\  x  e.  A )  ->  ( B  =  ( (inl  |`  A ) `  x
)  <->  ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) ) ) )
1110biimpd 144 . . . . 5  |-  ( (
ph  /\  x  e.  A )  ->  ( B  =  ( (inl  |`  A ) `  x
)  ->  ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) ) ) )
1211rexlimdva 2668 . . . 4  |-  ( ph  ->  ( E. x  e.  A  B  =  ( (inl  |`  A ) `  x )  ->  ( (/) 
e.  A  /\  B  =  ( (inl  |`  A ) `
 (/) ) ) ) )
1312imp 124 . . 3  |-  ( (
ph  /\  E. x  e.  A  B  =  ( (inl  |`  A ) `
 x ) )  ->  ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) ) )
1413orcd 745 . 2  |-  ( (
ph  /\  E. x  e.  A  B  =  ( (inl  |`  A ) `
 x ) )  ->  ( ( (/)  e.  A  /\  B  =  ( (inl  |`  A ) `
 (/) ) )  \/  B  =  ( (inr  |`  1o ) `  (/) ) ) )
15 simpr 110 . . . . . . . . 9  |-  ( (
ph  /\  x  e.  1o )  ->  x  e.  1o )
1615, 3sylib 122 . . . . . . . 8  |-  ( (
ph  /\  x  e.  1o )  ->  x  =  (/) )
1716fveq2d 5699 . . . . . . 7  |-  ( (
ph  /\  x  e.  1o )  ->  ( (inr  |`  1o ) `  x
)  =  ( (inr  |`  1o ) `  (/) ) )
1817eqeq2d 2250 . . . . . 6  |-  ( (
ph  /\  x  e.  1o )  ->  ( B  =  ( (inr  |`  1o ) `
 x )  <->  B  =  ( (inr  |`  1o ) `
 (/) ) ) )
1918biimpd 144 . . . . 5  |-  ( (
ph  /\  x  e.  1o )  ->  ( B  =  ( (inr  |`  1o ) `
 x )  ->  B  =  ( (inr  |`  1o ) `  (/) ) ) )
2019rexlimdva 2668 . . . 4  |-  ( ph  ->  ( E. x  e.  1o  B  =  ( (inr  |`  1o ) `  x )  ->  B  =  ( (inr  |`  1o ) `
 (/) ) ) )
2120imp 124 . . 3  |-  ( (
ph  /\  E. x  e.  1o  B  =  ( (inr  |`  1o ) `  x ) )  ->  B  =  ( (inr  |`  1o ) `  (/) ) )
2221olcd 746 . 2  |-  ( (
ph  /\  E. x  e.  1o  B  =  ( (inr  |`  1o ) `  x ) )  -> 
( ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) )  \/  B  =  ( (inr  |`  1o ) `
 (/) ) ) )
23 exmidfodomrlemreseldju.el . . 3  |-  ( ph  ->  B  e.  ( A 1o ) )
24 eldju 7408 . . 3  |-  ( B  e.  ( A 1o )  <-> 
( E. x  e.  A  B  =  ( (inl  |`  A ) `  x )  \/  E. x  e.  1o  B  =  ( (inr  |`  1o ) `
 x ) ) )
2523, 24sylib 122 . 2  |-  ( ph  ->  ( E. x  e.  A  B  =  ( (inl  |`  A ) `  x )  \/  E. x  e.  1o  B  =  ( (inr  |`  1o ) `
 x ) ) )
2614, 22, 25mpjaodan 810 1  |-  ( ph  ->  ( ( (/)  e.  A  /\  B  =  (
(inl  |`  A ) `  (/) ) )  \/  B  =  ( (inr  |`  1o ) `
 (/) ) ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    \/ wo 720    = wceq 1402    e. wcel 2209   E.wrex 2529    C_ wss 3220   (/)c0 3520    |` cres 4776   ` cfv 5377   1oc1o 6680   ⊔ cdju 7377  inlcinl 7385  inrcinr 7386
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-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578
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-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  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-1o 6687  df-dju 7378  df-inl 7387  df-inr 7388
This theorem is used by:  exmidfodomrlemrALT  7555
  Copyright terms: Public domain W3C validator