Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  restuni3 Structured version   Visualization version   GIF version

Theorem restuni3 45119
Description: The underlying set of a subspace induced by the subspace operator t. The result can be applied, for instance, to topologies and sigma-algebras. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypotheses
Ref Expression
restuni3.1 (𝜑𝐴𝑉)
restuni3.2 (𝜑𝐵𝑊)
Assertion
Ref Expression
restuni3 (𝜑 (𝐴t 𝐵) = ( 𝐴𝐵))

Proof of Theorem restuni3
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eluni2 4878 . . . . . . . 8 (𝑥 (𝐴t 𝐵) ↔ ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
21biimpi 216 . . . . . . 7 (𝑥 (𝐴t 𝐵) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
32adantl 481 . . . . . 6 ((𝜑𝑥 (𝐴t 𝐵)) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
4 simpr 484 . . . . . . . . . . . 12 ((𝜑𝑦 ∈ (𝐴t 𝐵)) → 𝑦 ∈ (𝐴t 𝐵))
5 restuni3.1 . . . . . . . . . . . . . 14 (𝜑𝐴𝑉)
6 restuni3.2 . . . . . . . . . . . . . 14 (𝜑𝐵𝑊)
7 elrest 17397 . . . . . . . . . . . . . 14 ((𝐴𝑉𝐵𝑊) → (𝑦 ∈ (𝐴t 𝐵) ↔ ∃𝑧𝐴 𝑦 = (𝑧𝐵)))
85, 6, 7syl2anc 584 . . . . . . . . . . . . 13 (𝜑 → (𝑦 ∈ (𝐴t 𝐵) ↔ ∃𝑧𝐴 𝑦 = (𝑧𝐵)))
98adantr 480 . . . . . . . . . . . 12 ((𝜑𝑦 ∈ (𝐴t 𝐵)) → (𝑦 ∈ (𝐴t 𝐵) ↔ ∃𝑧𝐴 𝑦 = (𝑧𝐵)))
104, 9mpbid 232 . . . . . . . . . . 11 ((𝜑𝑦 ∈ (𝐴t 𝐵)) → ∃𝑧𝐴 𝑦 = (𝑧𝐵))
11103adant3 1132 . . . . . . . . . 10 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → ∃𝑧𝐴 𝑦 = (𝑧𝐵))
12 simpl 482 . . . . . . . . . . . . . 14 ((𝑥𝑦𝑦 = (𝑧𝐵)) → 𝑥𝑦)
13 simpr 484 . . . . . . . . . . . . . 14 ((𝑥𝑦𝑦 = (𝑧𝐵)) → 𝑦 = (𝑧𝐵))
1412, 13eleqtrd 2831 . . . . . . . . . . . . 13 ((𝑥𝑦𝑦 = (𝑧𝐵)) → 𝑥 ∈ (𝑧𝐵))
1514ex 412 . . . . . . . . . . . 12 (𝑥𝑦 → (𝑦 = (𝑧𝐵) → 𝑥 ∈ (𝑧𝐵)))
16153ad2ant3 1135 . . . . . . . . . . 11 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → (𝑦 = (𝑧𝐵) → 𝑥 ∈ (𝑧𝐵)))
1716reximdv 3149 . . . . . . . . . 10 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → (∃𝑧𝐴 𝑦 = (𝑧𝐵) → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵)))
1811, 17mpd 15 . . . . . . . . 9 ((𝜑𝑦 ∈ (𝐴t 𝐵) ∧ 𝑥𝑦) → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵))
19183exp 1119 . . . . . . . 8 (𝜑 → (𝑦 ∈ (𝐴t 𝐵) → (𝑥𝑦 → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵))))
2019rexlimdv 3133 . . . . . . 7 (𝜑 → (∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦 → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵)))
2120adantr 480 . . . . . 6 ((𝜑𝑥 (𝐴t 𝐵)) → (∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦 → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵)))
223, 21mpd 15 . . . . 5 ((𝜑𝑥 (𝐴t 𝐵)) → ∃𝑧𝐴 𝑥 ∈ (𝑧𝐵))
23 elinel1 4167 . . . . . . . . . . 11 (𝑥 ∈ (𝑧𝐵) → 𝑥𝑧)
2423adantl 481 . . . . . . . . . 10 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥𝑧)
25 simpl 482 . . . . . . . . . 10 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑧𝐴)
26 elunii 4879 . . . . . . . . . 10 ((𝑥𝑧𝑧𝐴) → 𝑥 𝐴)
2724, 25, 26syl2anc 584 . . . . . . . . 9 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥 𝐴)
28 elinel2 4168 . . . . . . . . . 10 (𝑥 ∈ (𝑧𝐵) → 𝑥𝐵)
2928adantl 481 . . . . . . . . 9 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥𝐵)
3027, 29elind 4166 . . . . . . . 8 ((𝑧𝐴𝑥 ∈ (𝑧𝐵)) → 𝑥 ∈ ( 𝐴𝐵))
3130ex 412 . . . . . . 7 (𝑧𝐴 → (𝑥 ∈ (𝑧𝐵) → 𝑥 ∈ ( 𝐴𝐵)))
3231adantl 481 . . . . . 6 (((𝜑𝑥 (𝐴t 𝐵)) ∧ 𝑧𝐴) → (𝑥 ∈ (𝑧𝐵) → 𝑥 ∈ ( 𝐴𝐵)))
3332rexlimdva 3135 . . . . 5 ((𝜑𝑥 (𝐴t 𝐵)) → (∃𝑧𝐴 𝑥 ∈ (𝑧𝐵) → 𝑥 ∈ ( 𝐴𝐵)))
3422, 33mpd 15 . . . 4 ((𝜑𝑥 (𝐴t 𝐵)) → 𝑥 ∈ ( 𝐴𝐵))
3534ralrimiva 3126 . . 3 (𝜑 → ∀𝑥 (𝐴t 𝐵)𝑥 ∈ ( 𝐴𝐵))
36 dfss3 3938 . . 3 ( (𝐴t 𝐵) ⊆ ( 𝐴𝐵) ↔ ∀𝑥 (𝐴t 𝐵)𝑥 ∈ ( 𝐴𝐵))
3735, 36sylibr 234 . 2 (𝜑 (𝐴t 𝐵) ⊆ ( 𝐴𝐵))
38 elinel1 4167 . . . . . 6 (𝑥 ∈ ( 𝐴𝐵) → 𝑥 𝐴)
39 eluni2 4878 . . . . . 6 (𝑥 𝐴 ↔ ∃𝑧𝐴 𝑥𝑧)
4038, 39sylib 218 . . . . 5 (𝑥 ∈ ( 𝐴𝐵) → ∃𝑧𝐴 𝑥𝑧)
4140adantl 481 . . . 4 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → ∃𝑧𝐴 𝑥𝑧)
425adantr 480 . . . . . . . . . 10 ((𝜑𝑧𝐴) → 𝐴𝑉)
436adantr 480 . . . . . . . . . 10 ((𝜑𝑧𝐴) → 𝐵𝑊)
44 simpr 484 . . . . . . . . . 10 ((𝜑𝑧𝐴) → 𝑧𝐴)
45 eqid 2730 . . . . . . . . . 10 (𝑧𝐵) = (𝑧𝐵)
4642, 43, 44, 45elrestd 45109 . . . . . . . . 9 ((𝜑𝑧𝐴) → (𝑧𝐵) ∈ (𝐴t 𝐵))
47463adant3 1132 . . . . . . . 8 ((𝜑𝑧𝐴𝑥𝑧) → (𝑧𝐵) ∈ (𝐴t 𝐵))
48473adant1r 1178 . . . . . . 7 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → (𝑧𝐵) ∈ (𝐴t 𝐵))
49 simp3 1138 . . . . . . . 8 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥𝑧)
50 simp1r 1199 . . . . . . . . 9 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥 ∈ ( 𝐴𝐵))
51 elinel2 4168 . . . . . . . . 9 (𝑥 ∈ ( 𝐴𝐵) → 𝑥𝐵)
5250, 51syl 17 . . . . . . . 8 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥𝐵)
53 simpl 482 . . . . . . . . 9 ((𝑥𝑧𝑥𝐵) → 𝑥𝑧)
54 simpr 484 . . . . . . . . 9 ((𝑥𝑧𝑥𝐵) → 𝑥𝐵)
5553, 54elind 4166 . . . . . . . 8 ((𝑥𝑧𝑥𝐵) → 𝑥 ∈ (𝑧𝐵))
5649, 52, 55syl2anc 584 . . . . . . 7 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → 𝑥 ∈ (𝑧𝐵))
57 eleq2 2818 . . . . . . . 8 (𝑦 = (𝑧𝐵) → (𝑥𝑦𝑥 ∈ (𝑧𝐵)))
5857rspcev 3591 . . . . . . 7 (((𝑧𝐵) ∈ (𝐴t 𝐵) ∧ 𝑥 ∈ (𝑧𝐵)) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
5948, 56, 58syl2anc 584 . . . . . 6 (((𝜑𝑥 ∈ ( 𝐴𝐵)) ∧ 𝑧𝐴𝑥𝑧) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
60593exp 1119 . . . . 5 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → (𝑧𝐴 → (𝑥𝑧 → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)))
6160rexlimdv 3133 . . . 4 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → (∃𝑧𝐴 𝑥𝑧 → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦))
6241, 61mpd 15 . . 3 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → ∃𝑦 ∈ (𝐴t 𝐵)𝑥𝑦)
6362, 1sylibr 234 . 2 ((𝜑𝑥 ∈ ( 𝐴𝐵)) → 𝑥 (𝐴t 𝐵))
6437, 63eqelssd 3971 1 (𝜑 (𝐴t 𝐵) = ( 𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3045  wrex 3054  cin 3916  wss 3917   cuni 4874  (class class class)co 7390  t crest 17390
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-mpo 7395  df-rest 17392
This theorem is referenced by:  restuni4  45122  subsalsal  46364
  Copyright terms: Public domain W3C validator