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

Theorem wessep 4574
Description: A subset of a set well-ordered by set membership is well-ordered by set membership. (Contributed by Jim Kingdon, 30-Sep-2021.)
Assertion
Ref Expression
wessep (( E We 𝐴𝐵𝐴) → E We 𝐵)

Proof of Theorem wessep
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ssel 3149 . . . . . . 7 (𝐵𝐴 → (𝑥𝐵𝑥𝐴))
2 ssel 3149 . . . . . . 7 (𝐵𝐴 → (𝑦𝐵𝑦𝐴))
3 ssel 3149 . . . . . . 7 (𝐵𝐴 → (𝑧𝐵𝑧𝐴))
41, 2, 33anim123d 1319 . . . . . 6 (𝐵𝐴 → ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥𝐴𝑦𝐴𝑧𝐴)))
54adantl 277 . . . . 5 (( E We 𝐴𝐵𝐴) → ((𝑥𝐵𝑦𝐵𝑧𝐵) → (𝑥𝐴𝑦𝐴𝑧𝐴)))
65imdistani 445 . . . 4 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → (( E We 𝐴𝐵𝐴) ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)))
7 wetrep 4357 . . . . . 6 (( E We 𝐴 ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
87adantlr 477 . . . . 5 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥𝑦𝑦𝑧) → 𝑥𝑧))
9 epel 4289 . . . . . 6 (𝑥 E 𝑦𝑥𝑦)
10 epel 4289 . . . . . 6 (𝑦 E 𝑧𝑦𝑧)
119, 10anbi12i 460 . . . . 5 ((𝑥 E 𝑦𝑦 E 𝑧) ↔ (𝑥𝑦𝑦𝑧))
12 epel 4289 . . . . 5 (𝑥 E 𝑧𝑥𝑧)
138, 11, 123imtr4g 205 . . . 4 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐴𝑦𝐴𝑧𝐴)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
146, 13syl 14 . . 3 ((( E We 𝐴𝐵𝐴) ∧ (𝑥𝐵𝑦𝐵𝑧𝐵)) → ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
1514ralrimivvva 2560 . 2 (( E We 𝐴𝐵𝐴) → ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
16 zfregfr 4570 . . 3 E Fr 𝐵
17 df-wetr 4331 . . 3 ( E We 𝐵 ↔ ( E Fr 𝐵 ∧ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧)))
1816, 17mpbiran 940 . 2 ( E We 𝐵 ↔ ∀𝑥𝐵𝑦𝐵𝑧𝐵 ((𝑥 E 𝑦𝑦 E 𝑧) → 𝑥 E 𝑧))
1915, 18sylibr 134 1 (( E We 𝐴𝐵𝐴) → E We 𝐵)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 978  wcel 2148  wral 2455  wss 3129   class class class wbr 4000   E cep 4284   Fr wfr 4325   We wwe 4327
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-setind 4533
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-v 2739  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-br 4001  df-opab 4062  df-eprel 4286  df-frfor 4328  df-frind 4329  df-wetr 4331
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator