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

Theorem exmidfodomrlemeldju 7470
Description: Lemma for exmidfodomr 7475. A variant of djur 7328. (Contributed by Jim Kingdon, 2-Jul-2022.)
Hypotheses
Ref Expression
exmidfodomrlemeldju.a (𝜑𝐴 ⊆ 1o)
exmidfodomrlemeldju.el (𝜑𝐵 ∈ (𝐴 ⊔ 1o))
Assertion
Ref Expression
exmidfodomrlemeldju (𝜑 → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅)))

Proof of Theorem exmidfodomrlemeldju
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 exmidfodomrlemeldju.a . . . . . . . . . 10 (𝜑𝐴 ⊆ 1o)
21sselda 3228 . . . . . . . . 9 ((𝜑𝑥𝐴) → 𝑥 ∈ 1o)
3 el1o 6648 . . . . . . . . 9 (𝑥 ∈ 1o𝑥 = ∅)
42, 3sylib 122 . . . . . . . 8 ((𝜑𝑥𝐴) → 𝑥 = ∅)
54fveq2d 5652 . . . . . . 7 ((𝜑𝑥𝐴) → (inl‘𝑥) = (inl‘∅))
65eqeq2d 2243 . . . . . 6 ((𝜑𝑥𝐴) → (𝐵 = (inl‘𝑥) ↔ 𝐵 = (inl‘∅)))
76biimpd 144 . . . . 5 ((𝜑𝑥𝐴) → (𝐵 = (inl‘𝑥) → 𝐵 = (inl‘∅)))
87rexlimdva 2651 . . . 4 (𝜑 → (∃𝑥𝐴 𝐵 = (inl‘𝑥) → 𝐵 = (inl‘∅)))
98imp 124 . . 3 ((𝜑 ∧ ∃𝑥𝐴 𝐵 = (inl‘𝑥)) → 𝐵 = (inl‘∅))
109orcd 741 . 2 ((𝜑 ∧ ∃𝑥𝐴 𝐵 = (inl‘𝑥)) → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅)))
11 simpr 110 . . . . . . . . 9 ((𝜑𝑥 ∈ 1o) → 𝑥 ∈ 1o)
1211, 3sylib 122 . . . . . . . 8 ((𝜑𝑥 ∈ 1o) → 𝑥 = ∅)
1312fveq2d 5652 . . . . . . 7 ((𝜑𝑥 ∈ 1o) → (inr‘𝑥) = (inr‘∅))
1413eqeq2d 2243 . . . . . 6 ((𝜑𝑥 ∈ 1o) → (𝐵 = (inr‘𝑥) ↔ 𝐵 = (inr‘∅)))
1514biimpd 144 . . . . 5 ((𝜑𝑥 ∈ 1o) → (𝐵 = (inr‘𝑥) → 𝐵 = (inr‘∅)))
1615rexlimdva 2651 . . . 4 (𝜑 → (∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥) → 𝐵 = (inr‘∅)))
1716imp 124 . . 3 ((𝜑 ∧ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥)) → 𝐵 = (inr‘∅))
1817olcd 742 . 2 ((𝜑 ∧ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥)) → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅)))
19 exmidfodomrlemeldju.el . . 3 (𝜑𝐵 ∈ (𝐴 ⊔ 1o))
20 djur 7328 . . 3 (𝐵 ∈ (𝐴 ⊔ 1o) ↔ (∃𝑥𝐴 𝐵 = (inl‘𝑥) ∨ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥)))
2119, 20sylib 122 . 2 (𝜑 → (∃𝑥𝐴 𝐵 = (inl‘𝑥) ∨ ∃𝑥 ∈ 1o 𝐵 = (inr‘𝑥)))
2210, 18, 21mpjaodan 806 1 (𝜑 → (𝐵 = (inl‘∅) ∨ 𝐵 = (inr‘∅)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wo 716   = wceq 1398  wcel 2202  wrex 2512  wss 3201  c0 3496  cfv 5333  1oc1o 6618  cdju 7296  inlcinl 7304  inrcinr 7305
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4212  ax-nul 4220  ax-pow 4270  ax-pr 4305  ax-un 4536
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-mpt 4157  df-tr 4193  df-id 4396  df-iord 4469  df-on 4471  df-suc 4474  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-1st 6312  df-2nd 6313  df-1o 6625  df-dju 7297  df-inl 7306  df-inr 7307
This theorem is referenced by:  exmidfodomrlemr  7473
  Copyright terms: Public domain W3C validator