Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > ineccnvmo2 | Structured version Visualization version GIF version |
Description: Equivalence of a double universal quantification restricted to the range and an "at most one" inside a universal quantification. (Contributed by Peter Mazsa, 4-Sep-2021.) |
Ref | Expression |
---|---|
ineccnvmo2 | ⊢ (∀𝑥 ∈ ran 𝐹∀𝑦 ∈ ran 𝐹(𝑥 = 𝑦 ∨ ([𝑥]◡𝐹 ∩ [𝑦]◡𝐹) = ∅) ↔ ∀𝑢∃*𝑥 𝑢𝐹𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ineccnvmo 35626 | . 2 ⊢ (∀𝑥 ∈ ran 𝐹∀𝑦 ∈ ran 𝐹(𝑥 = 𝑦 ∨ ([𝑥]◡𝐹 ∩ [𝑦]◡𝐹) = ∅) ↔ ∀𝑢∃*𝑥 ∈ ran 𝐹 𝑢𝐹𝑥) | |
2 | alrmomorn 35627 | . 2 ⊢ (∀𝑢∃*𝑥 ∈ ran 𝐹 𝑢𝐹𝑥 ↔ ∀𝑢∃*𝑥 𝑢𝐹𝑥) | |
3 | 1, 2 | bitri 277 | 1 ⊢ (∀𝑥 ∈ ran 𝐹∀𝑦 ∈ ran 𝐹(𝑥 = 𝑦 ∨ ([𝑥]◡𝐹 ∩ [𝑦]◡𝐹) = ∅) ↔ ∀𝑢∃*𝑥 𝑢𝐹𝑥) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∨ wo 843 ∀wal 1535 = wceq 1537 ∃*wmo 2620 ∀wral 3138 ∃*wrmo 3141 ∩ cin 3935 ∅c0 4291 class class class wbr 5066 ◡ccnv 5554 ran crn 5556 [cec 8287 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-br 5067 df-opab 5129 df-xp 5561 df-rel 5562 df-cnv 5563 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-ec 8291 |
This theorem is referenced by: cossssid5 35726 dffunsALTV5 35935 |
Copyright terms: Public domain | W3C validator |